    #include <bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    #include <ext/pb_ds/detail/standard_policies.hpp>
 
    using namespace std;
    using namespace __gnu_pbds;
 
    #define endl "\n" //interactive 
    #define fi first
    #define se second
    #define pb push_back
    #define int long long   
    #define ll long long
    #define ld long double
    #define pii pair<ll,ll>
    typedef vector<int> vi;
 
    #define read(t) ll t;cin>>t;
    #define all(value) value.begin(),value.end()
    #define f(a,b,c) for(ll a=b;a<c;a++)
    #define F(i,n) for(ll i=0;i<n;i++)
 
    #define deb(value) cerr << #value << " is =" << value << endl;
    #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) ;
 
    typedef tree<pair<ll,ll>, null_type,less<pair<ll,ll>>, rb_tree_tag,tree_order_statistics_node_update> omultiset; // store ind on sec 
    typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> oset;
    typedef tree<long long,null_type,greater<long long>,rb_tree_tag,tree_order_statistics_node_update> oset1; // decreasing 
   /* member functions :
                1. order_of_key(k) : number of elements strictly lesser than k
                2. find_by_order(k) : k-th element in the set (counting from zero)*/

    //a.erase(unique(a.begin(),a.end()),a.end()); 

    double pi=3.141592653589793238462641;
    ll dx[4]={1,-1,0,0},dy[4]={0,0,1,-1};

    const int  mod  =  1e9+7 ; 
    const int  mod2 =  998244353;
    const int  inf  =  1e18;

    long long binpow(int a,int b,int m)
    {   
        a %= m;int res = 1;
        while (b > 0)
        { 
            if (b & 1)res=(res*a)%m;
            a=(a*a)%m  ;    b/=2; 
        }
        return res;
    }
    int modinv(int n,int m) {return binpow(n,m-2,m);}

    const int man=2e5+5;

/*

    $ don't apply unnecessary operations 
    $ do check boundary cases (i==1/n-1/n)

    $ change approach / use pen ? paper   
    $ Don't stuck! :- * re-solve 
                      * check for another sol
                      * check function , cal 
                                          
                                    
                
*/
/*......................................................................................................................*/



void solve()
{   
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int a=(2*i)%n;
        if(a==0)a=n;
        int b=(2*i+1)%n;
        if(b==0)b=n;
        cout<<a<<" "<<b<<endl;
    }

}


signed main() 
{
    fast;

    int test=1;
    // cin>>test;
    while(test--)solve();

    return 0;
}   
#include<bits/stdc++.h>
using namespace std;
#define int long long int

signed main(){
    int t = 1; cin >> t;
    while(t--){
        int n; cin >> n;
        vector<int> a(n);
        for(auto &x:a)
            cin >> x;
        sort(a.begin(),a.end());
        if(n%2)
        {
            cout << "Second\n";
            continue;
        }
        int even = 0, odd = 0;
        for(int i = n-1; i >= 0; i -= 2)
            odd += a[i];
        for(int i = n-2; i >= 0; i -= 2)
            even += a[i];
        if(even == odd)
            cout << "Second\n";
        else cout << "First\n";
    }    
}