// 互测原题 /jy

// what is matter? never mind.
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first 
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,a[maxn],xsum,b[maxn];

bool ok(int l,int r)
{
	for(int i=l;i<=r;i+=2)
		if(b[i]!=b[i+1])return 0;
	return 1;
}
bool chk(int l,int r)
{
	assert((r-l+1)%2==0);
	if(l>r)return 1;
	int i=l,j=r;
	while(i<=j && b[i]==b[j])++i,--j;
	if(i>j)return 1;
	if(ok(i,j))return 1;
	if(i-1>=l && ok(i-1,j+1))return 1;
	return 0;
}

void work()
{
	n=read(),xsum=0;
	For(i,1,n)a[i]=read(),xsum^=a[i];
	if(!xsum){
		puts("Draw");
		return;
	}
	int bt=0;
	Rep(i,30,0)if(xsum>>i&1)bt=i;
	For(i,1,n)b[i]=(a[i]>>bt&1);
	if(n%2==0){
		puts("First");
		return;
	}
	int sum=accumulate(b+1,b+n+1,0);
	int s1=sum/2+1,s2=sum/2;
	if(s1%2==0){
		puts("Second");
		return;
	}
	if((b[1]&&chk(2,n)) || (b[n]&&chk(1,n-1))){
		puts("First");
		return;
	}
	puts("Second");
}

signed main()
{
	int T=read();
	while(T--)work();
	return 0;
}