1 //
  2 //by coolxxx
  3 //#include<bits/stdc++.h>
  4 #include<iostream>
  5 #include<algorithm>
  6 #include<string>
  7 #include<iomanip>
  8 #include<map>
  9 #include<stack>
 10 #include<queue>
 11 #include<set>
 12 #include<bitset>
 13 #include<memory.h>
 14 #include<time.h>
 15 #include<stdio.h>
 16 #include<stdlib.h>
 17 #include<string.h>
 18 //#include<stdbool.h>
 19 #include<math.h>
 20 #pragma comment(linker,"/STACK:1024000000,1024000000")
 21 #define min(a,b) ((a)<(b)?(a):(b))
 22 #define max(a,b) ((a)>(b)?(a):(b))
 23 #define abs(a) ((a)>0?(a):(-(a)))
 24 #define lowbit(a) (a&(-a))
 25 #define sqr(a) ((a)*(a))
 26 #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))
 27 #define mem(a,b) memset(a,b,sizeof(a))
 28 #define eps (1e-8)
 29 #define J 10000
 30 #define mod 2147493647
 31 #define MAX 0x7f7f7f7f
 32 #define PI 3.14159265358979323
 33 #define N 2024
 34 #define M 2031124
 35 using namespace std;
 36 typedef long long LL;
 37 double anss;
 38 LL aans;
 39 int cas,cass;
 40 int n,m,lll,ans;
 41 int in[N],last[N];
 42 bool u[N];
 43 char s[N][N];
 44 struct xxx
 45 {
 46     int next,to;
 47 }e[M];
 48 void add(int x,int y)
 49 {
 50     e[++lll].next=last[x];
 51     e[lll].to=y;
 52     last[x]=lll;
 53 }
 54 void tuopu()
 55 {
 56     int i,now,to;
 57     ans=0;
 58     queue<int>q;
 59     for(i=1;i<=n;i++)
 60         if(!in[i])
 61         {
 62             u[i]=1;ans++;
 63             q.push(i);
 64         }
 65     while(!q.empty())
 66     {
 67         now=q.front();q.pop();
 68         for(i=last[now];i;i=e[i].next)
 69         {
 70             to=e[i].to;
 71             if(u[to])continue;
 72             if(!(--in[to]))
 73             {
 74                 u[to]=1;ans++;
 75                 q.push(to);
 76             }
 77         }
 78     }
 79 }
 80 int main()
 81 {
 82     #ifndef ONLINE_JUDGE
 83     freopen("1.txt","r",stdin);
 84 //    freopen("2.txt","w",stdout);
 85     #endif
 86     int i,j,k;
 87     int x,y,z;
 88 //    init();
 89     for(scanf("%d",&cass);cass;cass--)
 90 //    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)
 91 //    while(~scanf("%s",s))
 92 //    while(~scanf("%d%d",&n,&m))
 93     {
 94         lll=0;mem(in,0);mem(last,0);mem(u,0);
 95         scanf("%d",&n);
 96         for(i=1;i<=n;i++)
 97             scanf("%s",s[i]+1);
 98         for(i=1;i<=n;i++)
 99         {
100             for(j=1;j<=n;j++)
101             {
102                 if(s[i][j]==‘P‘)
103                     add(i,j),in[j]++;
104                 else if(s[i][j]==‘Q‘)
105                     add(i,j),in[j]++;
106             }
107         }
108         tuopu();
109         if(ans<n){puts("N");continue;}
110         lll=0;mem(in,0);mem(last,0);mem(u,0);
111         for(i=1;i<=n;i++)
112         {
113             for(j=1;j<=n;j++)
114             {
115                 if(s[i][j]==‘P‘)
116                     add(i,j),in[j]++;
117                 else if(s[i][j]==‘Q‘)
118                     add(j,i),in[i]++;
119             }
120         }
121         tuopu();
122         if(ans<n)puts("N");
123         else puts("T");
124     }
125     return 0;
126 }
127 /*
128 //
129 
130 //
131 */