#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
using ll=long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 50;
 
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
using namespace std;

void solve(){
    string x;
    cin>>x;
    sort(x.rbegin(),x.rend());
    int n=x.size();
    map<char,int>mp;
    rep(i,n){
        mp[x[i]]++;
    }
    if(mp.size()==1){
        cout<<-1<<"\n";
        return;
    }
    if(mp.size()==2&&x[1]=='0'){
        cout<<-1<<"\n";
        return;
    }
    for(int i=n-2;i>=0;--i){
        if(x[i]!='0'){
            swap(x[i],x.back());
            break;
        }
    }
    rep(i,n)cout<<x[i];
    cout<<endl;
}
 
signed main(){
	ios::sync_with_stdio(false);
    cin.tie(0);
	cout<<fixed<<setprecision(15);
	solve();
	return 0;
}