#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto& i:a)
#define ff first 
#define ss second 
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define pb push_back
using namespace std;
using ll =long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
template<class T> inline bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T> inline bool chmax(T& a,T b){return a<b?a=b,1:0;}

void solve(){
    
}
int main(){
    string s;cin>>s;
    int flag=0;
    int n=s.size();
    rep(i,0,n){
        if(s[i]=='C'){
            flag=1;
        }
    }
    if(flag){
        map<char,int> mp={{'T',0},{'C',1},{'P',2}};
        sort(all(s),[&](char a,char b){
            return mp[a]<mp[b];
        });
        cout<<s<<'\n';
    }else{
        sort(all(s));
        cout<<s<<'\n';
    }
    
    return 0;
}
/*

*/