#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,n) for(int i = 0;i < (int)(n);i++)
#define RREP(i,n) for(int i = (int)n-1;i >= 0;i--)
#define FOR(i,s,n) for(int i = s;i < (int)n;i++)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;i--)
#define ALL(a) a.begin(),a.end()
#define IN(a, x, b) (a<=x && x<b)
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;}
constexpr long long INF = 1e18;


signed main(){
	string s;
	cin>>s;
	int zero = 0;
	string t = "";
	REP(i,s.size()){
		if(s[i]=='0')zero++;
		else t+=s[i];
	}
	sort(ALL(s));
	sort(ALL(t));
	reverse(ALL(t));
	if(t.size()<=1){
		cout<<-1<<endl;
		return 0;
	}
	string ans = "";
	REP(i,t.size()){
		ans += t[i];
	}
	REP(i,zero){
		ans += '0';
	}
	if(zero)swap(ans[t.size()-1],ans[t.size()]);
	else swap(ans[ans.size()-2],ans[ans.size()-1]);
	if(ans == s){
		cout<<-1<<endl;
		return 0;
	}
	cout<<ans<<endl;
}