#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    string s;
    cin>>s;
    sort(s.begin(),s.end());
    int n=s.size();
    int idx=0;
    while(idx<n-1&&s[idx]==s[idx+1])++idx;
    if(idx==n-1){
        cout<<-1<<endl;
        return 0;
    }
    if(idx+1==n-1&&s[idx]=='0'){
        cout<<-1<<endl;
        return 0;
    }
    swap(s[idx],s[idx+1]);
    reverse(s.begin(),s.end());
    cout<<s<<endl;
    return 0;
}