topcoder

#include <algorithm> 
#include <cassert> 
#include <cctype> 
#include <cmath> 
#include <complex> 
#include <cstdio> 
#include <cstdlib> 
#include <cstring> 
#include <ctime> 
#include <deque> 
#include <functional> 
#include <iterator> 
#include <iostream> 
#include <list> 
#include <map> 
#include <numeric> 
#include <queue> 
#include <set> 
#include <string> 
#include <valarray> 
#include <vector> 
#include <iomanip>
using namespace std;

typedef long long ll; 
typedef vector<int> vi; // vi(长度,值)
typedef vector<string> vs ; 
typedef vector<double> vd ; 
typedef istringstream ISS;
typedef ostringstream OSS;

#define all(a) (a).begin(),(a).end() 
#define mset(a,v) memset(a,v,sizeof(a)) 
#define pb push_back   //a.pb( ) 
#define min(a,b) ((a)<(b)?(a):(b)) 
#define max(a,b) ((a)>(b)?(a):(b)) 
#define sz size()
#define rep(i,n) for(int i=0;i<(n);i++)
#define swap(a,b) a^=b^=a^=b;



class SwappingDigits
{
public:
    int minnum0(string num)
    {
        int i,min0=0;
        int len=num.length();
        for (i=len-1;i>0;i--)
        {
            if((num[i] < num[min0])&&(num[i] != '0'))
                min0 = i;
        }
        return min0;
    }
    int minnump(string num,int j)
    {
        int i,minp=j;
        int len=num.length();
        for (i=len;i>j;i--)
        {
            if((num[i] < num[minp]))
                minp = i;
        }
        return minp;
    }
    string minNumber(string num)
    {
        int i,j,mid;
        int len=num.length();
        mid = len/2;

        i = minnum0(num);
        if(i)
        {
            swap(num[i],num[0]);
            return num;
        }

        for(j=1;j<mid;j++)
        {
            i=minnump(num,j);
            if(i != j)
            {
                swap(num[i],num[j]);
                return num;
            }
        }
        
        return num;
    }
};
int main()
{
    SwappingDigits sol;
    string s;
    while(true)
    {
        cin>>s;
        cout<<sol.minNumber(s)<<endl;
    }
}