#include <iostream>
#include <algorithm>
#include <vector>
#include <numeric>
#include <random>
#include <chrono>
#include <queue>
#include <utility>
#include <string>
#include <set>
#include <map>
#include <cmath>
#include <limits>
#include <stack>

#define faster ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define showv(v) for(int i : v) cout << i + 1 << ' '; cout << '\n';
#define all(v) v.begin(), v.end()
#define MAXN 120000

using namespace std;
using namespace std::chrono;
typedef long long   ll;
typedef long double ld;

int inf = 1e9 + 9;
int mod = 1e9 + 7;

int dp[2005][2005];
int df[2005][2005];

template <typename T>
void show(T * begin, T * end) {
    for(T * it = begin;it != end;it++)
        cout << *it << ' ';
    cout << '\n';
}

void solve() {
    string s; cin >> s;
    if(s[0] == s[1] && s[1] == s[2]) cout << "Won\n";
    else cout << "Lost\n";
}

int main() {
    faster
    int test; test = 1;
    while(test--) {
        solve();
    }
    // auto start = high_resolution_clock::now();
    // auto stop  = high_resolution_clock::now();
    // double time = duration_cast<milliseconds>( stop - start ).count();
    // cout << time << " ms" << endl;
    return 0;
}

#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("First");}else{puts("Second");}
#define MAX_N 200005

int main() {
    int T; cin >> T;
    rep(_,T){
        int n; cin >> n;
        ll a[n] = {};
        rep(i,n) cin >> a[i];
        if(n % 2 == 1){
            cout << "Second" << endl;
            continue;
        }

        sort(a,a+n);
        int ok = 0;
        rep(i,n/2){
            if(a[i*2]!=a[i*2+1])ok = 1;
        }
        if(ok)yn;
    }
    return 0;
}


