#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    string s;
    cin >> s;
    sort(s.begin(),s.end());
    while (1)
    {
        bool doagain=0;
        for(int i=1; i<s.size(); i++)
        {
            if(s[i]==s[i-1])
            {
                doagain=1;
                break;
            }
        }
        if(!doagain)
        break;
        next_permutation(s.begin(),s.end());
    }
    cout << s;
    return 0;
}
/**

aaabbbbghc
abababcbgh

*/