#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9,MOD = 1e9+7,ohara = 1e6;
const ll LINF = 1e18;
using namespace std;

#define rep(i,n) for(ll (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(ll i=(a);i<(b);i++)
#define rrrep(i,a,b) for(ll i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Size(n) (n).size()
#define Cout(x) cout<<(x)<<endl

ll n,cnt=0,a,b,c,d,cmp,cmpp,m,h,w,x,y,sum=0,pos;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
//int dy[]={-1,0,1,-1,1,-1,0,1};
//int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"),s,ans="114514";
bool fl;
struct edge{int to,cost;};

//-------------------------↓↓↓↓↓↓------------------------

bool check(string co){
    ll ret=0;
    rep(i,Size(s)){
        if(s[i]!=co[i])ret++;
    }
    if(ret<=2)return true;
    else return false;
}

int main(void){
       cin.tie(0);
    ios::sync_with_stdio(false);
      
    cin>>s;
    vector<ll> p(Size(s));
    rep(i,Size(s))p[i]=i;
    do{
        string co;
        rep(i,Size(s)){
            co+=s[p[i]];
        }
        if(!check(co))continue;
        if(ans=="114514")ans=co;
        else{
            if(ans<co)ans=co;
        }
    }while(next_permutation(all(p)));
    Cout(ans);
    return 0;
}