#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include<bits/stdc++.h>
#define PII pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
using ll = long long;
using namespace std;
using namespace __gnu_pbds;
inline int read(){
	int x=0,f=1;char c=getchar();while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c)){x=(x<<3)+(x<<1)+(c^48);c=getchar();}
	return f==-1?~x+1:x;
}
int T;
int n;
int a[50010],b[50010];
bool check(int l,int r){
	int len=1;
	while(b[l+1]==b[l]&&l<r){
		++len;++l;
	}
	while(r>=l&&b[l]==b[r]){
		++len,--r;
	}
	if(len&1) return 0;
	for(int i=l+1;i<=r;++i){
		int j=i;
		while(b[j+1]==b[i]) ++j;
		if(j-i+1%2) return 0;
		i=j;
	}
	return 1;
}
int main(){
	T=read();
	while(T--){
		n=read();
		int su=0;
		for(int i=1;i<=n;++i){
			a[i]=read();su^=a[i];
		}
		if(su==0){
			printf("Draw\n");continue ;
		}
		if(n%2==0){
			printf("First\n");continue ;
		}
		int hbt=__lg(su);
		int cnt=0;
		for(int i=1;i<=n;++i) if(a[i]>>hbt&1){
			++cnt;b[i]=1;
		}
		else b[i]=0;
		if(cnt%4==3){
			printf("Second\n");continue ;
		}
		printf((check(2,n)||check(1,n-1))?"First\n":"Second\n");
	}
}