#include <bits/stdc++.h>
#define int long long int
using namespace std;
signed main(){
    ios::sync_with_stdio(0);
	cin.tie(NULL); cout.tie(NULL);
	int t;
	cin>>t;
	while(t--){
        int n;
        cin>>n;
        map<int , int> mp;
        bool ae = true;
        for(int i = 1;i<= n;i++){
            int z;
            cin>>z;
            mp[z]++;
        }
        map<int , int>:: iterator it;
        for(it = mp.begin() ; it!= mp.end();it++){
            if((it->second)%2==0 ){
                ;
            }
            else{
                ae = false;
            }
        }
         if(n%2==0){
            if(ae){
                cout<<"Second\n";
            }
            else{
                cout<<"First\n";
            }
        }
        else{
            cout<<"Second\n";
        }
	}
}

#include <bits/stdc++.h>

#define vi vector<int>
#define tests int t; cin>>t; while(t--)
#define ll long long
#define vll vector<long long>
#define srt(v) sort(v.begin(), v.end())
#define srtg(v) sort(v.begin(), v.end(), greater<int> ())
#define FOR(k, n) for(int k=0; k<n; k++)
#define pb push_back
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl



using namespace std;


char nums[10] = { '0','1','2','3','4','5','6','7','8','9' };
char alphsl[26] = { 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z' };
const int MOD = 1000000007;
char alphs[26] = { 'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z' };


void solve() {
    
    vi v(4);
    cin>>v[0]>>v[1]>>v[2]>>v[3];
    int sum=v[0]+v[1]+v[2]+v[3];
    if(sum%2==1) {
        cout<<"No"<<endl;
        return;
    }
   if(v[0]==sum/2||v[1]==sum/2||v[2]==sum/2||v[3]==sum/2||v[0]+v[1]==sum/2||v[0]+v[2]==sum/2||v[0]+v[3]==sum/2||v[1]+v[2]==sum/2||v[1]+v[3]==sum/2||v[2]+v[3]==sum/2){
       cout<<"Yes"<<endl;
   }
   else cout<<"No"<<endl;
}


int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

        
        solve();


    return 0;
}