#include "bits/stdc++.h"
#define REP(i, n) for(int i = 0; i < int(n); i++)
#define FOR(i,n,m) for(int i = int(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 6;
const ll LLINF = 1e18 + 1;

int main() {
    string s; cin >> s;
    sort(s.rbegin(), s.rend());
    bool same = true;
    REP(i, s.size()) {
        if (s[0] != s[i]) {
            same = false;
        }
    }
    if (same) {
        puts("-1");
        return 0;
    }
    for (int i = s.size() - 1; i >= 0; i--) {
        if (s[i] != s[s.size() - 1]) {
            swap(s[i], s[i + 1]);
            break;
        }
    }
    if (s[0] == '0') {
        puts("-1");
    }
    else {
        cout << s << endl;
    }
    return 0;
}