#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    string s; cin >> s;

    int f[10] = {};
    rep(i,s.size()){
        f[(int)s[i] - 48]++;
    }
    int flag = 0;
    int sum = 0;
    srep(i,1,10){
        if(f[i] > 0)flag++;
        sum += f[i];
    }

    if(flag == 1){
        if(f[0] == 0){
            cout << "-1" << endl;
            return 0;
        }
        if(sum == 1){
            cout << "-1" << endl;
            return 0;
        }
    }

    int x = -1;
    int y = -1;
    flag = 0;
    rep(i,10){
        if(f[i] > 0){
            if(flag == 0){
                x = i;
                f[i]--;
                flag++;
            }else{
                y = i;
                f[i]--;
                break;
            }
        }
    }

    drep(i,10){
        rep(j,f[i]){
            cout << i;
        }
        if(i == y){
            cout << x << y;
        }
    }
    cout << endl;
    
    return 0;
}