#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)

template <typename T> bool chmin(T &x, T y) {
	return x > y ? (x = y, true) : false;
}
template <typename T> bool chmax(T &x, T y) {
	return x < y ? (x = y, true) : false;
}

struct IOST {
	IOST() {
		ios::sync_with_stdio(false);
		cin.tie(nullptr);
		cout << fixed << setprecision(20);
	}
} IOST;

void solve(){
	string s;
	cin>>s;
	map<char,int> mp;
	for(char c:s) mp[c]++;
	if(mp.count('C')){
		cout<<string(mp['T'],'T')+string(mp['C'],'C')+string(mp['P'],'P')<<"\n";
	}else{
		sort(s.begin(),s.end());
		cout<<s<<"\n";
	}
}

int main(){
	int t=1;
	// cin>>t;
	rep(i,0,t) solve();
}