#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // std::ifstream in("input.txt");
    // std::cin.rdbuf(in.rdbuf());
    string s;
    cin >> s;
    map<char, ll> m;
    rep(i, len(s)) m[s[i]]++;
    if (sz(m) == 1) {
        cout << -1 << endl;
        return 0;
    }
    ll nz = 0;
    for(auto x : m) {
        if (x.first != '0') nz += x.second;
    }
    if ((m.count('0') > 0) && (nz == 1)) {
        cout << -1 << endl;
        return 0;
    }
    sort(all(s));
    reverse(all(s));
    prev_permutation(all(s));
    cout << s << endl;
    return 0;
}