#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int maxn=111111,mod=998244353;
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#define MEM(x,v) memset(x,v,sizeof(x))
inline ll read(){
    char ch=getchar();ll x=0,f=0;
    while(ch<'0' || ch>'9') f|=ch=='-',ch=getchar();
    while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();
    return f?-x:x;
}
inline int qpow(int a,int b){
    int ans=1;
    for(;b;b>>=1,a=1ll*a*a%mod) if(b&1) ans=1ll*ans*a%mod;
    return ans;
}
int n,p[maxn];
bool vis[maxn];
void dfs(int u){
    vis[u]=true;
    if(!vis[p[u]]) dfs(p[u]);
}
void solve(){
    n=read();
    FOR(i,1,n) p[i]=read(),vis[i]=false;
    int cnt=0;
    FOR(i,1,n) if(!vis[i]) dfs(i),cnt++;
    puts(cnt<=30?"Second":"First");
}
int main(){
    int T=read();
    while(T--) solve();
}