#include<bits/stdc++.h>
#define rep(i, a, b) for(int i = (a);i <= (b);++i)
#define per(i, a, b) for(int i = (a);i >= (b);--i)
#define lc (k << 1)
#define rc (k << 1 | 1)
#define lowbit(x) ((x) & -(x))
#define odd(x) ((x) & 1)
#define even(x) (!odd(x))
#define fir first
#define sec second
#define pb push_back
#define il inline
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define i128 __int128
#define f128 __float128
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << "In Line " << __LINE__ << " the " << #x << " = " << (x) << "\n"
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<class T> using vc = vector<T>;
template<class Tx, class Ty>
il void chkmx(Tx& x, const Ty y) {x = max<common_type_t<Tx, Ty>>(x, y);}
template<class Tx, class Ty>
il void chkmn(Tx& x, const Ty y) {x = min<common_type_t<Tx, Ty>>(x, y);}
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3fll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
bool ms;

const int N = 1005;
int a[N], c[31];
int vis[N][N][2];

void solve() {
    int n;
    cin >> n;
    memset(c, 0, sizeof(c));
    rep(i, 1, n) {
        cin >> a[i];
        rep(j, 0, 30)
            c[j] ^= a[i] >> j & 1;
    }
    int p = -1;
    per(i, 30, 0) {
        if(c[i] == 1) {
            p = i;
            break;
        }
    }
    if(p == -1) {
        cout << "Draw\n";
        return;
    }
    rep(i, 1, n)
        a[i] = a[i] >> p & 1;
    auto cmp = [&](int x, int y) -> int {
        if(x > y)
            return 1;
        if(x < y)
            return -1;
        return 0;
    };
    memset(vis, 0x3f, sizeof(vis));
    auto calc = [&](auto&& self, int l, int r, int x, int y) -> int {
        if(l == r) {
            x ^= a[l];
            return cmp(x, y);
        }
        if(l + 1 == r)
            return max(cmp(x ^ a[l], y ^ a[r]), cmp(x ^ a[r], y ^ a[l]));
        if(vis[l][r][x] != inf)
            return vis[l][r][x];
        int& ans = vis[l][r][x];
        int r1 = self(self, l + 2, r, x ^ a[l], y ^ a[l + 1]);
        int r2 = self(self, l + 1, r - 1, x ^ a[l], y ^ a[r]);
        int r3 = self(self, l + 1, r - 1, x ^ a[r], y ^ a[l]);
        int r4 = self(self, l, r - 2, x ^ a[r], y ^ a[r - 1]);
        if((r1 == 1 && r2 == 1) || (r3 == 1 && r4 == 1))
            return ans = 1;
        if((r1 >= 0 && r2 >= 0) || (r3 >= 0 && r4 >= 0))
            return ans = 0;
        return ans = -1;
    };
    int ans = calc(calc, 1, n, 0, 0);
    if(ans == 1)
        cout << "First\n";
    else
        cout << "Second\n";
}

bool mt;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cerr << fabs(&ms - &mt) / 1024 / 1024 << "\n";
    int t;
    cin >> t;
    while(t--)
        solve();
    cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
    return 0;
}