#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	string x;
	cin>>x;
	sort(x.begin(), x.end(), greater<char>());
	int n=x.size();
	int k;
	for(int i=n-1; i>=0; i--){
		if(x[i]!='0'){
			k=i;
			break;
		}
	}
	if(k==0){
		cout<<-1<<endl;
	}else if(k==n-1){
		bool ok=0;
		for(int i=0; i<n-1; i++){
			if(x[i]!=x[i+1]){
				ok=1;
				break;
			}
		}
		if(!ok){
			cout<<-1<<endl;
			return 0;
		}
		swap(x[n-1], x[n-2]);
		cout<<x<<endl;
	}else{
		swap(x[k], x[k+1]);
		cout<<x<<endl;
	}
	return 0;
}