#include <bits/stdc++.h>
using namespace std;

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  int tc;
  cin >> tc;

  while (tc--) {
    int n;
    cin >> n;
  
    set<int> s;
    for (int i = 0; i < n; ++i) {
      int a;
      cin >> a;
      
      if (s.find(a) != s.end()) s.erase(a);
      else s.insert(a);
    }

    if (n&1) cout << "Second\n";
    else if (s.size()) cout << "First\n";
    else cout << "Second\n";
  }
}

#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;
using lint=long long;

void solve(){
	int n; scanf("%d",&n);
	vector<lint> a(n);
	rep(i,n) scanf("%lld",&a[i]);

	if(n%2==0){
		map<int,int> f;
		rep(i,n) ++f[a[i]];
		bool ok=true;
		for(auto p:f) if(p.second%2==1) ok=false;
		puts(!ok?"First":"Second");
	}
	else{
		puts("Second");
	}
}

int main(){
	int q; scanf("%d",&q); rep(_,q) solve();
	return 0;
}
