#include <bits/stdc++.h>
using namespace std;

int main(){
    string s;
    cin >> s;
    int n = s.length();

    bool same = true, one = true;
    for (int i = 0; i < n-1; i++) {
        if (s[i] != s[i+1]) same = false;
    }

    sort(s.begin(), s.end());
    reverse(s.begin(), s.end());
    if (s[1] != '0') one = false;

    if (same == false && one == false) {
        reverse(s.begin(), s.end());
        for (int i = 1; i < n; i++) {
            if (s[i] != '0') {
                swap(s[i], s[i-1]);
                break;
            }
        }
        reverse(s.begin(), s.end());
        cout << s << endl;
    } else {
        cout << -1 << endl;
    }
    return 0;
}