#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int T,n;
int a[50005],b[50005];

void solve(){
	scanf("%d",&n);
	int sum = 0;
	rep(i,1,n){
		scanf("%d",&a[i]);
		sum ^= a[i];
	}
	if(!sum){
		printf("Draw\n");
		return;
	}
	int p = __lg(sum);
	rep(i,1,n) b[i] = (a[i] >> p) & 1;

	if(n % 2 == 1){
		rep(i,1,n){
			if(!b[i]){
				printf("First\n");
				return;
			}
		}
		printf("Second\n");
		return;
	}
	int c0 = 0,c1 = 1;
	rep(i,1,n){
		if(!b[i]) c0++;
		else c1++;
	}
	if((!b[1] || !b[n]) && c0 == 1){
		printf("First\n");
		return;
	}
	if((b[1] || b[n]) && c1 == 1){
		printf("First\n");
		return;
	}
	printf("Second\n");
}

int main(){
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}