#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);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    string x;
    cin >> x;
    map<char, ll> cnt;
    rep(i, len(x)) cnt[x[i]]++;
    if (sz(cnt) == 1) {
        cout << -1 << endl;
        return 0;
    }
    else if (sz(cnt) == 2) {
        ll nz = 0;
        for(auto x : cnt) {
            if (x.first != '0') nz += x.second;
        }
        if (nz == 1) {
            cout << -1 << endl;
            return 0;
        }
    }
    else {
        auto itl = cnt.begin();
        auto its = cnt.begin();
        its++;
        auto it = cnt.end(); it--;
        string ans = "";
        while(true) {
            if ((it != itl) && (it != its)) {
                rep(i, it->second) ans += it->first;
            }
            else {
                rep(i, it->second - 1) ans += it->first;
            }
            if (it == cnt.begin()) break;
            it--;
        }
        ans += itl->first;
        ans += its->first;
        cout << ans << endl;
    }
    return 0;
}