#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
#include<math.h>
#include <iomanip>
#include<set>
#include <numeric>
using namespace std;


int main()
{
    string s;
    cin >> s;
    int n = s.size(), cnt = 0;
    vector<int> v(10);
    set<int> st;
    bool l = 0, pl = 0;
    for (int i = 0; i < n; i++){
        v[s[i] - '0']++;
    }
    for (int i = 0; i < 10; i++){
        if (v[i]){
            cnt++;
            st.insert(i);
        }
    }
    if (cnt == 1){
        cout << -1 << endl;
        return 0;
    } else if (cnt == 2){
        if (v[0]) cout << -1 << endl;
        return 0;
    }
    for (int i = 9; i > -1; i--){
        auto itr = st.begin();
        if (i == *st.begin()){
            itr++;
            cout << *itr++;
            v[i]--;
        }
        itr++;
        if (i == *itr) pl = 1;
        while (v[i]){
            if (v[i]!=1){
                cout << i;
            }
            if (v[i] == 1 && pl){
                cout << *st.begin();
            } else {
                cout << i;
            }
            v[i]--;
        }
    }
    cout << endl;
}