#include<bits/stdc++.h>

using namespace std;
const int N = 5e4 + 7;
int T, n;
int a[N];

map<string,bool>mp[2];
vector<int>R;
bool Sol(int l,int r,int sp)
{
    int c1=0;for(int i=l;i<=r;i++)c1+=R[i];if(c1%2)return 0;
    c1/=2;c1+=sp;if(c1%2==0)return 0;
    //cout<<c1<<"%%\n";
    while(r-l+1>=4)
    {
        int A=R[l],B=R[l+1],C=R[r-1],D=R[r];l+=2,r-=2;
        bool x=(A==D&&B==C),y=(A==B&&C==D);
        if(!(x||y))return 0;
    }
    return 1;
}
void sol()
{
    if(n%2==0){cout<<"First\n";return;}
    int ans=Sol(1,n-1,R[n])|Sol(2,n,R[1]);
    if(ans){cout<<"First\n";return;}cout<<"Second\n";
}
void solve() {
    cin >> n;
    for (int i = 1; i <= n; i++)cin >> a[i];
    for (int i = 30; i >= 0; i--) {
        vector<int> b(n + 1, 0);
        int sum = 0;
        for (int j = 1; j <= n; j++) {
            b[j] = a[j] >> i & 1;
            sum += b[j];
        }
        if (sum % 2 == 0)continue;
        R=b;
        sol();return;
        ////
        sum--;
        stack<int> stk;
        for (int i = 1; i <= n; i++) {
            if (stk.size() && stk.top() == b[i])stk.pop();
            else stk.push(b[i]);
        }
        if (stk.size() == 1) {
            if (sum / 2 % 2 == 0)cout << "First\n";
            else cout << "Second\n";
        } else if (stk.size() % 2 == 0)cout << "First\n";
        else cout << "Second\n";
        return;
    }
    cout << "Draw\n";
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> T;
    while (T--)solve();
    return 0;
}