- 得出重要结论:p*(t-p-1)==s.length()-1-t
#include<iostream>
#include<map>
using namespace std;
int main(){
int n;cin>>n;
while(n--){
int t=0,p=0;
map<char,int> m;
string s;
cin>>s;
for(int j=0;j<s.size();j++){
m[s[j]]++;
if(s[j]=='P') p=j;
if(s[j]=='T') t=j;
}
if(m['P']==1&&m['T']==1&&(t-p)!=1&&m.size()==3&&p*(t-p-1)==s.length()-1-t)
cout<<"YES
";
else cout<<"NO
";
}
return 0;
}