#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <vector>
#include <numeric>

#define ll long long

using namespace std;

int main(){
  
   string n;
   cin>>n;
   vector<char> v;
   for(int i=0;i<n.length();++i) v.push_back(n[i]);
   string ans=n;
   do{

      int dff=0;
      for(int i=0;i<n.length();++i) if(n[i]!=v[i]) dff++;
      if(dff>2) continue;

      string t="";
      for(int i=0;i<n.length();++i) t+=v[i];
    
      ans=max(ans,t);

   }while(next_permutation(v.begin(),v.end()));

   cout<<ans<<endl;

   return 0;
}