#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long LL;

int n,m,coline;
int A[90][3];
char rst[90];

inline int check(int s,LL x,LL y,LL z){
    if (x==0 && y==0 && z==0) return 0;
    coline=0;
    LL u=x*A[s][0]+y*A[s][1]+z*A[s][2];
    for (int i=0; i<n; i++){
        LL tu=x*A[i][0]+y*A[i][1]+z*A[i][2];
        if (tu>u) return 0;
    }
    return 1;
}

int gao(int s){
    if (n<=4) return 1;
    for (int i=0; i<n; i++) if (i!=s){
        LL a1=A[i][0]-A[s][0];
        LL b1=A[i][1]-A[s][1];
        LL c1=A[i][2]-A[s][2];
        for (int j=i+1; j<n; j++) if (j!=s){
            LL a2=A[j][0]-A[s][0];
            LL b2=A[j][1]-A[s][1];
            LL c2=A[j][2]-A[s][2];
            LL ux=a2-a1, uy=b2-b1, uz=c2-c1;
            for (int k=j+1; k<n; k++) if (k!=s){
                LL a3=A[k][0]-A[s][0];
                LL b3=A[k][1]-A[s][1];
                LL c3=A[k][2]-A[s][2];
                LL vx=a3-a1, vy=b3-b1, vz=c3-c1;
                LL x=uy*vz-vy*uz;
                LL y=uz*vx-ux*vz;
                LL z=ux*vy-uy*vx;
                if (check(s,x,y,z) || check(s,-x,-y,-z)) return 1;
            }
        }
    }
    return 0;
}

int main(){
    int t;
    scanf("%d",&t);
    while (t--){
        scanf("%d",&n);
        for (int i=0; i<n; i++)
            for (int j=0; j<3; j++) scanf("%d",&A[i][j]);
        rst[n]=0;
        coline=1;
        for (int i=0; i<n; i++)
            if (gao(i)) rst[i]='T'; else rst[i]='F';
        if (coline) fill(rst,rst+n,'T');
        puts(rst);
    }
    return 0;
}