#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<list>
#include<bitset>
#include<stack>
#include<memory>
#include<numeric>
#include <utility>


using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define REP(i, n) for(int i = 0;i < (n);i++)
/*cout<<fixed<<setprecision(20);cin.tie(0);ios::sync_with_stdio(false);*/
const llint mod=1000000007;
const llint inf=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-10;
template <class T,class U>bool chmin(T& a,U b){if(a>b){a=b;return true;}return false;}
template <class T,class U>bool chmax(T& a,U b){if(a<b){a=b;return true;}return false;}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){if(a==0){return b;}return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(const vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(const vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}

int main(void){
	int T;cin>>T;
	while(T--){
		int i,j,n;cin>>n;
		vector<llint>a(n);
		for(i=0;i<n;i++){cin>>a[i];}
		SO(a);
		if(n%2==0){
			string ans="Second";
			for(i=0;i<n;i+=2){
				if(a[i]!=a[i+1]){ans="First";}
			}
			cout<<ans<<endl;
		}else{
			cout<<"Second"<<endl;
		}
	}
	return 0;
}
#include <bits/stdc++.h>

using namespace std;
/*---------------------SAUGATA KUNDU---------------------------*/

#define int long long int
#define INF (int)(1e9+5)
#define MoD (int)(998244353)
//#define debugn(a) cerr << '[' << ( a ) << ']' << '\n'
#define debug(a) cerr << '[' << a << ']' << '\n'

#define clear(a) memset(a, 0, sizeof(a))
#define fo(i, a, b) for(int i = a; i < b; i++)
#define fos(i, b) for(int i = 0; i < b; i++)
#define foe(i, a) for(auto &i: a)
#define re(i, a, b) for(int i = b-1; i >= a; i--)
#define pb push_back
#define all(c) c.begin(), c.end()
#define sz(x) (int)(x).size()
#define Fast ios::sync_with_stdio(0);cin.tie(0)
//data_structures
#define vt vector
#define que queue
#define sta stack
#define pque priority_queue
#define dque deque

#define point(pt) vt<int>::iterator pt
template<typename T> void read(vt<T> &a){
	fos(i, sz(a)) cin >> a[i];
}

#define endl '\n'
template<typename T> void write(vt<T> a){
	fos(i, sz(a)) cout << a[i] << ' ';
	cout << endl;
}

void solve(){
	int a;
	cin >> a;

	cout << 100-(a%100) << endl;
}


int32_t main() {
	Fast;

	int t=1;
	//cin >> t;
	for(int i=1; i<=t; ++i) {
		//cout << "Case " <<i<<":\n";
		solve();
	}

}