#include<bits/stdc++.h>
using namespace std;

typedef long long s64;
const int D=998244353;
s64 pow_mod(s64 x,int y){
    s64 ans=1;
    while(y){
        if(y&1)ans=ans*x%D;
        x=x*x%D;y>>=1;
    }
    return ans;
}
const int N=1e5+5;
int p[N],c[N];
int query(int i){
    int ans=0;
    for(;i<N;i+=i&-i)ans+=c[i];
    return ans;
}
void add(int i){
    for(;i;i-=i&-i)++c[i];
}
double Q(int n){
    for(int i=1;i<N;++i)c[i]=0;
    double ans=0;
    for(int i=1;i<=n;++i){
        ans+=p[i]==i;
    }
    return ans/n;
}

int main(){
#ifdef kcz
    freopen("1.in","r",stdin);//freopen("1.out","w",stdout);
#endif
    mt19937 rng;
    /*for(int n=5e4;n<=1e5;n+=1e4){
        for(int i=1;i<=n;++i)p[i]=i;
        for(int i=1;i<=3*n;++i){
            int x=rng()%n+1,y=rng()%n+1;
            swap(p[x],p[y]);
        }
        cout<<Q(n)<<" ";
        for(int i=1;i<=4*n;++i){
            int x=rng()%n+1,y=rng()%n+1;
            swap(p[x],p[y]);
        }
        cout<<Q(n)<<endl;
    }*/

    int tt;
    cin>>tt;
    while(tt--){
        int n;
        cin>>n;
        int ans=0;
        for(int i=1;i<=n;++i){
            int x;scanf("%d",&x);
            ans+=x==i;
        }
        puts(ans*1000<n?"Second":"First");
    }
}