#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=5e4+9;
ll T,n,a[N];
bool chk(ll l,ll r){
    ll s=0;
    rep(i,l,r)s+=a[i];
    if(s%4)return 0;
    while(l<=r&&a[l]==a[r])l++,r--;
    if(l>r)return 1;
    rep(i,l,r){
        if((i-l+1)&1){
            if(a[i]!=a[i+1])return 0;
        }
    }
    return 1;
}
void solve(){
    n=read();
    rep(i,1,n)a[i]=read();
    per(i,30,0){
        ll cnt=0;
        rep(j,1,n){
            if((a[j]>>i)&1)cnt++;
        }
        if(cnt&1){
            rep(j,1,n)a[j]=(a[j]>>i)&1;
            break;
        }
        if(!i)return puts("Draw"),void();
    }
    if(!(n&1))return puts("First"),void(); 
    if(!a[1]&&!a[n])return puts("Second"),void();
    if(chk(2,n)||chk(1,n-1))return puts("First"),void();
    puts("Second");
}
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    T=read();
    while(T--)solve();
    cerr<<clock()*1.0/CLOCKS_PER_SEC*1000<<"ms\n";
    return 0;
}