#include <bits/stdc++.h>
using namespace std;

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;
}