J

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

//*****************Data type**********************//
typedef long long ll;
typedef long long int lli;
typedef unsigned long long  ull;
typedef unsigned long long int ulli;

//*****************Map****************************//
typedef map<int, int> mp;
typedef map<int, string> mps;
typedef map<int, char>mpc;
typedef map<string, int>mpsi;
typedef map<char, int>mpci;

//****************Pair****************************//
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<char, char> pcc;
typedef pair<int, string> pis;
typedef pair<int, char> pic;

//*****************Vector************************//
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<double> VD;
typedef vector<lli> VLLI;
typedef vector<VI> VVI;
typedef vector<pii> VPI;

//****************SET**************************//
typedef set<int> seti;
typedef set<string> sets;
typedef set<char>setc;

//-------------------------------------------------------------------------------//
#define pp1(A)              printf("%d\n",A)
#define pp2(A,B)            printf("%d %d\n",A,B)
#define pp3(A,B,C)          printf("%d %d %d\n",A,B,C)

#define ss1(A)              scanf("%d", &A)
#define ssl(A)              scanf("%lld", &A)
#define ss2(A,B)            scanf("%d,%d",&A,&B)
#define ss3(A,B,C)          scanf("%d,%d,%d",&A,&B,&C)

//--------------------------------------------------------------------------------//
#define nosync              ios_base::sync_with_stdio(false), cin.tie(NULL)
#define pf                  push_front
#define pb                  push_back
#define popb                pop_back()
#define popf                pop_front()
#define itr                 iterator
#define mk                  make_pair
#define ff                  first
#define ss                  second
#define END                 return 0
#define line                printf("\n")
#define yes                 printf("YES\n")
#define no                  printf("NO\n")
#define enter               printf("Entered\n")
#define sq(a)               (a)*(a)
#define SZ(a)               (int)a.size()
#define all(a)              (a).begin(), (a).end()
#define Erase(V,I)          (V).erase((V).begin()+I)
#define Insert(V,I,M)       (V).insert((V).begin()+I,M)
#define max3(a,b,c)         max(max(a,b),c)
#define max4(a,b,c,d)       max(max3(a,b,c),d)
#define min3(a,b,c)         min(min(a,b),c)
#define min4(a,b,c,d)       min(min3(a,b,c),d)
#define READ()              freopen("input.txt", "r", stdin)
#define WRITE()             freopen("output.txt", "w", stdout)

//********************************************************************************//
#define loop(i,n)           for(lli i=0;i<n;i++)
#define loop2(i,n)          for(int i=n-1;i>=0;i--)
#define loop3(i,n)          for(int i=1;i<=n;i++)
#define vin(V, N)           for(int i=0; i<N; i++){ int X; ss1(X); V.pb(X); }
#define vinll(V, N)         for(int i=0; i<N; i++){ lli X; ssl(X); V.pb(X); }
#define scanA(A, N)         for(int i=0; i<N; i++){ ss1(A[i]); }
#define scanAll(A, N)       for(int i=0; i<N; i++){ ssl(A[i]); }
#define printA(A, N)        for(int i=0; i<N; i++){ cout<<A[i]; if (i==N-1)cout<<endl; }
#define vout(v)             for(int i = 0; i < v.size(); i++) {cout << v[i]; if(i < v.size() - 1) cout <<" "; else cout << endl;}

/*-----------------------GCD && LCM------------------*/
int gcd(int a, int b)
{
    return b == 0 ? a : gcd(b, a % b);
}
int lcm(int a, int b)
{
    return a * (b / gcd(a, b));
}
/*---------------------------------------------------*/

//---------------------------------*START*-----------------------------------------//

int main()
{
    //while(true)
    //{

        string str;
        set<int> stt;
        int a,b,c;
        cin>>str;
        c=str.size();
        int arr[c];
        b=0;
        while(b!=c)
        {
            arr[b]=str[b]-'0' ;

            stt.insert(arr[b]);
            b++;
        }
        if(stt.size()==1)
        {
            cout<<-1<<endl;
            END;
        }
        int count=0;
        for(int i=c-1; i>=1; i--)
        {

            int j=i;
            while(j--)
            {
                if(arr[i]==0 && j==0)
                {
                    continue;
                }
                if(arr[i]<arr[j] and arr[i]>arr[j+1])
                {
                    swap(arr[i],arr[j]);
                    count++;
                    break;
                }
                if(arr[i]<arr[i-1])
                {
                    swap(arr[i],arr[i-1]);
                    count++;
                    break;
                }

            }
            if(count>0)
            {
                break;
            }
        }
        if(count==0)
            cout<<-1<<endl;
        else
            printA(arr,c);

    //}
    END;
}