大连网络赛 1006 Football Games

//大连网络赛 1006 
// 吐槽：数据比较水。下面代码可以AC
// 但是正解好像是：排序后，前i项的和大于等于i*(i-1) 

#include <bits/stdc++.h>
using namespace std;
#define LL long long
typedef pair<int,int> pii;
const double inf = 123456789012345.0;
const LL MOD =100000000LL;
const int N =1e4+10;
#define clc(a,b) memset(a,b,sizeof(a))
const double eps = 1e-7;
void fre() {freopen("in.txt","r",stdin);}
void freout() {freopen("out.txt","w",stdout);}
inline int read() {int x=0,f=1;char ch=getchar();while(ch>'9'||ch<'0') {if(ch=='-') f=-1; ch=getchar();}while(ch>='0'&&ch<='9') {x=x*10+ch-'0';ch=getchar();}return x*f;}

int main(){
    int T;
    while(~scanf("%d",&T)){
        while(T--){
            int n;
            scanf("%d",&n);
            LL sum=0;
            int maxx=-1;
            for(int i=1;i<=n;i++){
                int x;
                scanf("%d",&x);
                maxx=max(maxx,x);
                sum+=x;
            }
            if((sum==n*(n-1))&&maxx<=(n-1)*2){
                puts("T");
            }
            else puts("F");
        }
    }
    return 0;
}