#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define aLL(g) (g).begin(),(g).end() #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define F(i,j,k) fill(i[0],i[0]+j*j,k) #define P(p) cout<<(p)< vi; typedef vector vl; typedef vector vd; typedef pair pii; typedef pair pll; typedef long long ll; int dx[] = { 0,1,0,-1 }; int dy[] = { -1,0,1,0 }; int sttoi(std::string str) { int ret; std::stringstream ss; ss << str; ss >> ret; return ret; } int par[MAX]; int ran[MAX]; string s; void solve() { string s; vector v; cin >> s; for (int i = 0; i < s.length(); i++) { v.push_back(s[i]); } sort(v.begin(),v.end()); for (int i = v.size()-1; i >= 0; i--) { cout << v[i]; } cout << endl; } int main() { solve(); return 0; }