#include<bits/stdc++.h>
using namespace std;using ll=long long;const int N=5e4+10;
int T,n,s,a[N],pre[N],suf[N];char buf[3][10]={"Draw","First","Second"};
int solve(int n,int *a){
	pre[1]=a[1];for(int j=3;j<=n;j+=2)pre[j]=pre[j-2]^a[j];
	suf[n]=a[n];for(int j=n-2;j>=1;j-=2)suf[j]=suf[j+2]^a[j];
	for(int j=1;j+2<=n;j+=2){
		int x=(j>1?pre[j-2]:0)^(j+4<=n?suf[j+4]:0);
		if(a[j]!=a[j+1]&&a[j+1]!=a[j+2])continue;
		if(a[j]==a[j+1]&&a[j+1]==a[j+2]){
			if(x)return 1;
		}
		else if(x^1)return 1;
	}
	return 2;
}
int get(){
	s=0;scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]),s^=a[i];
	if(!s)return 0;if(!(n&1))return 1;for(int i=__lg(s);~i;i--)if(s>>i&1){
		if(n==1)return a[1]?1:2;
		if(n==2){
			if(a[1]==a[2])return a[1]?1:2;
			return 1;
		}
		for(int j=1;j<=n;j++)a[j]=a[j]>>i&1;
		for(int j=1;j+2<=n;j++)if(a[j]!=a[j+1]&&a[j+1]!=a[j+2])return 2;
//		return 1;
		int l=1,r=n,now=0;
		for(;l<=r&&a[l]==a[r];l++,r--)now^=a[l];
		if(l>r)return now&1?1:2;
		if(solve(r-l+1,a+l-1)==2)return 2;
		if(l>1&&solve(r-l+3,a+l-2)==2)return 2;
		return 1;
	}return 0;
}
int main(){
	for(scanf("%d",&T);T--;)puts(buf[get()]);return 0;
}