#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int value(ll x) {
    if (x == 3) return 2;
    ll r = x % 5;
    if (r == 2 || r == 3) return 1;
    return 0;
}

bool solve_main(vector<ll> A) {
    int xr = 0;
    for (ll x : A) {
        xr ^= value(x);
    }
    return xr != 0;
}

vector<int> normalize(vector<int> v) {
    sort(v.begin(), v.end());
    return v;
}

map<vector<int>, bool> memo;

bool solve_bruteforce(vector<int> state) {
    state = normalize(state);

    if (memo.count(state)) return memo[state];

    int N = (int)state.size();

    bool has_move = false;
    for (int x : state) {
        if (x >= 2) has_move = true;
    }
    if (!has_move) return memo[state] = false;

    // 手番プレイヤーが山を1つ選ぶ
    for (int i = 0; i < N; i++) {
        int x = state[i];
        if (x < 2) continue;

        vector<int> rest = state;
        rest.erase(rest.begin() + i);

        bool this_heap_is_good = true;

        // 相手が分割を選ぶ
        for (int a = 1; a <= x - 1; a++) {
            int b = x - a;

            vector<int> next_a = rest;
            next_a.push_back(a);
            next_a = normalize(next_a);

            vector<int> next_b = rest;
            next_b.push_back(b);
            next_b = normalize(next_b);

            bool wa = solve_bruteforce(next_a);
            bool wb = solve_bruteforce(next_b);

            // 自分は a, b のどちらかを残せる。
            // どちらを残しても相手勝ちなら、この分割を相手に選ばれてダメ。
            if (wa && wb) {
                this_heap_is_good = false;
                break;
            }
        }

        if (this_heap_is_good) {
            return memo[state] = true;
        }
    }

    return memo[state] = false;
}

bool is_small_case(const vector<ll>& A) {
    if ((int)A.size() > 6) return false;
    for (ll x : A) {
        if (x > 10) return false;
    }
    return true;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    cin >> T;

    assert(T >= 1);

    long long total_N = 0;

    while (T--) {
        int N;
        cin >> N;

        assert(N >= 1);

        vector<ll> A(N);
        for (int i = 0; i < N; i++) {
            cin >> A[i];
            assert(1 <= A[i] && A[i] <= (ll)1e18);
        }

        total_N += N;
        assert(total_N <= 200000);

        bool ans_main = solve_main(A);
        bool ans = ans_main;

        if (is_small_case(A)) {
            vector<int> B(N);
            for (int i = 0; i < N; i++) {
                B[i] = (int)A[i];
            }

            memo.clear();
            bool ans_brute = solve_bruteforce(B);

            assert(ans_brute == ans_main);

            ans = ans_brute;
        }

        cout << (ans ? "First" : "Second") << '\n';
    }

    return 0;
}