#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;

#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v) v.begin(), v.end()
#define vprint(v) for(auto e:v){cout<<e<<" ";};cout<<endl;
#define vvprint(vv) for(auto v:vv){vprint(v)};

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

    char c1, c2, c3;
    cin >> c1 >> c2 >> c3;
    if(c1==c2 && c2==c3) cout << "Won" << endl;
    else cout << "Lost" << endl;
}

#include <cstdio>
#include <algorithm>

using namespace std;

int a[100000];

void solve() {
    int n, i;
    
    scanf("%d", &n);
    
    for (i = 0; i < n; i++) scanf("%d", &a[i]);
    
    sort(a, a + n);
    
    if (n % 2 == 0) {
        for (i = 0; i < n; i += 2) {
            if (a[i] != a[i + 1]) break;
        }
        
        if (i < n) {
            puts("First");
        } else {
            puts("Second");
        }
    } else {
        puts("Second");
    }
}

int main() {
    int t, i;
    
    scanf("%d", &t);
    
    for (i = 0; i < t; i++) solve();
    
    return 0;
}
