#include<bits/stdc++.h>

using namespace std;
const int N = 5e4 + 7;
int T, n;
int a[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;
        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;
}