#include <bits/stdc++.h>
using namespace std;
using lint = long long;
#define all(x) (x).begin(), (x).end()

int main(){
    string X;
    cin >> X;
    sort(all(X), greater<>());
    if(!prev_permutation(all(X))){
        cout << -1 << endl;
        return 0;
    }
    if(X[0] == '0'){
        cout << -1 << endl;
        return 0;
    }
    cout << X << endl;
}