#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e9;
const ll MOD = 1e9 + 7;

int main(){
    string s;
    cin >> s;
    int n = s.size();
    sort(rall(s));

    string ans = s;
    for(int i=n-1; i>0; i--){
        if(ans[i] != ans[i-1]){
            swap(ans[i], ans[i-1]);
            break;
        }
    }

    if(ans[0] == '0' || ans == s) cout << -1 << endl;
    else cout << ans << endl;
}