1. 分析题干
2. string读一行,遍历
//package lxk;
import java.math.BigInteger;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void solve(String s) {
int idp = -1, idt = -1;
int cntp = 0, cntt = 0;
for(int i = 0; i < s.length(); ++i) {
if(s.charAt(i) == 'A') continue;
if(s.charAt(i) == 'P') {
idp = i;
cntp++;
}
else if(s.charAt(i) == 'T') {
idt = i;
cntt++;
}
else {
System.out.println("NO");
return;
}
}
if(cntp != 1 || cntt != 1 || idp > idt || s.length()<=2) {
System.out.println("NO");
return;
}
if((idp)*(idt-idp-1) == (s.length()-idt-1)) {
System.out.println("YES");
}
else {
System.out.println("NO");
}
return;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int T = in.nextInt();
while((T--) > 0) {
String s = in.next();
solve(s);
}
}
}