
// Problem : D - Let's Play Nim
// Contest : AtCoder - AtCoder Regular Contest 105
// URL : https://atcoder.jp/contests/arc105/tasks/arc105_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

#include <bits/stdc++.h>

using namespace std;

int T;
int N;
int arr[100005];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> T;
	while(T--){
		cin >> N;
		for(int i = 1; i<=N; i++){
			cin >> arr[i];
		}
		sort(arr+1, arr+1+N);
		if(N%2 == 1){
			cout << "Second\n";
		}
		else{
			bool secondwin = 1;
			for(int i = 2; i<=N; i+=2){
				if(arr[i] != arr[i-1]){
					secondwin = 0;
				}
			}
			if(secondwin){
				cout << "Second\n";
			}
			else{
				cout << "First\n";
			}
		}
	}
}
#include <bits/stdc++.h>
using namespace std;
int main()
{
  int n; cin >> n;
  map<int, int> mp;
  vector<int> v(1 << n, 0);
  for (int i = 0; i < 1 << n; i ++ )
  {
    int x; scanf("%d", &x);
    v.push_back(x);
    mp[x] = i;
  }
  for (int i = 0; i < n - 1; i ++ )
  {
    vector<int> a;
    for (int j = 0; j < v.size(); j += 2)
      a.push_back(max(v[j], v[j + 1]));
    v = a;
  }
  cout << mp[min(v[v.size() - 2], v[v.size() - 1])] + 1 << endl;
  return 0;
}
