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

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int& it : a) cin >> it;
    if (n & 1) {
        cout << "Second\n";
    } else {
        sort(a.begin(), a.end());
        bool win = false;
        for (int i = 0; i < n; i += 2) {
            win |= a[i] != a[i + 1];
        }
        cout << (win ? "First\n" : "Second\n");
    }
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int tt = 1;
    cin >> tt;
    while (tt--)
        solve();
    return 0;
}
#include <bits/stdc++.h>
using namespace std;

#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << '\n'
typedef long long ll;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
//const ll MOD = 998244353;

template <typename T> inline bool chmax(T &a, T b) {return a < b ? a = b, true : false;}
template <typename T> inline bool chmin(T &a, T b) {return a > b ? a = b, true : false;}

void solve() {
    ll n;   cin >> n;
    string ans;
    if(n == 1){
        ans = "Odd";
    }else if(n % 2 == 0){
        if(n / 2 % 2) ans = "Same";
        else ans = "Even";
    }else{
        ans = "Odd";
    }
    print(ans);
}

int main() { 
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(18);

    int t;
    cin >> t;
    //t = 1;
    while(t--) solve();
    return 0;
}