#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())
#define pb push_back

int arr[50005];

bool rcheck(int l, int r) {
    if (l > r) return true;
    if (arr[l] == arr[r]) return rcheck(l + 1, r - 1);
    for (int i = l; i + 1 <= r; i += 2)
        if (arr[i] != arr[i + 1])
            return false;
    return true;
}

bool check(int l, int r) {
    int sum = accumulate(arr + l, arr + r + 1, 0);
    if (sum % 4 != 0) return true;
    return !rcheck(l, r);
}

void solve() {
    int n, xorsum = 0;
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> arr[i], xorsum ^= arr[i];
    if (xorsum == 0) {
        cout << "Draw\n";
        return;
    }
    if (n % 2 == 0 || n == 1) {
        cout << "First\n";
        return;
    }
    int high = __lg(xorsum);
    for (int i = 1; i <= n; ++i)
        arr[i] = arr[i] >> high & 1;
    if (arr[1] == 1 && !check(2, n))
        cout << "First\n";
    else if (arr[n] == 1 && !check(1, n - 1))
        cout << "First\n";
    else 
        cout << "Second\n";
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();        
    }
}