#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
using namespace std;

using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(),v.end()
template<class T> inline bool chmax(T& a, T b) {if (a<b) {a=b; return true;} return false;}
template<class T> inline bool chmin(T& a, T b) {if (a>b) {a=b; return true;} return false;}
#define DEBUG_VLL(vec) REP(sz, vec.size()) cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');

const ll MOD = 1000000007;
const ll HIGHINF = (ll)1e18;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    string s; cin >> s;
    map<char, ll> sc;
    REP(i, s.size()) sc[s[i]]++;
    if (sc.find('0') != sc.end() && sc['0'] == s.size() - 1) cout << -1 << '\n';
    else if (sc.size() == 1) cout << -1 << '\n';
    else {
        V< P<char, ll> > ssc;
        for (P<char, ll> _sc: sc) ssc.emplace_back(_sc);
        for (ll i = ssc.size() - 1; i > 1; i--) {
            for (ll j = 0; j < ssc[i].second; j++) cout << ssc[i].first;
        }
        for (ll i = 0; i < ssc[1].second - 1; i++) cout << ssc[1].first;
        cout << ssc[0].first;
        cout << ssc[1].first;
        for (ll i = 0; i < ssc[0].second - 1; i++) cout << ssc[0].first;
        cout << '\n';
    }
    return 0;
}