#pragma GCC optimize("Ofast") #include <iostream> #include <vector> #include <algorithm> #include <map> #include <queue> #include <cstdio> #include <ctime> #include <assert.h> #include <chrono> #include <random> #include <numeric> #include <set> #include <deque> #include <stack> #include <sstream> #include <utility> #include <cstring> #include <unordered_map> #include <unordered_set> #include <tuple> #include <array> #include <bitset> using namespace std; typedef long long int ll; typedef unsigned long long ull; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); ll myRand(ll B) { return (ull)rng() % B; } inline double time() { return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int q; cin >> q; while(q--){ int n; cin >> n; vector<ll> a(n); ll sum = 0; bool ok = true; ll mi = 2e9; for(int i=0;i<n;i++){ cin >> a[i]; sum += a[i]-1; mi = min(mi, a[i]); } if(sum%2){ cout << "First" << "\n"; } else{ if(mi == 1){ cout << "Second" << "\n"; } else{ sum -= n; mi--; if(sum%2){ cout << "Second" << "\n"; } else{ if(mi%2) cout << "First" << "\n"; else cout << "Second" << "\n"; } } } } }