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

const int maxn = 2e5+8, inf  = 1e18+9, mod  = 998244353;

struct node { int a; char c; } a[maxn];
int n, m;

void solve() {
    int i, j;
    cin >> n; n *= 2;
    for (i = 1; i <= n; i++) cin >> a[i].a >> a[i].c;
    sort(a + 1, a + n + 1, [](node &o1, node &o2) { if (o1.c != o2.c) return o1.c < o2.c; else return o1.a < o2.a; });
    vector<int> R, G, B;
    for (i = 1; i <= n; i++) {
        if (a[i].c == 'R') R.push_back(a[i].a);
        else if (a[i].c == 'G') G.push_back(a[i].a);
        else B.push_back(a[i].a);
    }
    if (B.size() % 2 != 0) {
        if (R.size() % 2 == 0) swap(B, R);
        else swap(B, G);
    }
    if (R.size() % 2 == 0) return (void)(cout << 0 << endl);
    int ans = inf; i = 0, j = 0;
    while (i < R.size() && j < G.size()) {
        ans = min(ans, llabs(R[i] - G[j]));
        if (R[i] < G[j]) i++;
        else j++;
    }
    i = 0, j = 0;
    while (i < R.size() && j < G.size()) {
        ans = min(ans, llabs(R[i] - G[j]));
        if (G[j] < R[i]) j++;
        else i++;
    }

    int idx = 0, idx2 = 0, g1 = inf, g2 = inf;
    i = 0; j = 0;
    while (i < R.size() && j < B.size()) {
        if (g1 > llabs(R[i] - B[j])) g1 = llabs(R[i] - B[j]), idx = j;
        if (R[i] < B[j]) i++;
        else j++;
    }
    i = 0; j = 0;
    while (i < R.size() && j < B.size()) {
        if (g1 > llabs(R[i] - B[j])) g1 = llabs(R[i] - B[j]), idx = j;
        if (B[j] < R[i]) j++;
        else i++;
    }

    i = 0; j = 0;
    while (i < G.size() && j < B.size()) {
        if (j == idx) {
            j++; 
            continue;
        }
        if (g2 > llabs(G[i] - B[j])) g2 = llabs(G[i] - B[j]);
        if (G[i] < B[j]) i++;
        else j++;
    }
    i = 0; j = 0;
    while (i < G.size() && j < B.size()) {
        if (j == idx) {
            j++;
            continue;
        }
        if (g2 > llabs(G[i] - B[j])) g2 = llabs(G[i] - B[j]);
        if (B[j] < G[i]) j++;
        else i++;
    }
    ans = min(ans, g1 + g2);
    g1 = g2 = inf;

    while (i < G.size() && j < B.size()) {
        if (g1 > llabs(G[i] - B[j])) g1 = llabs(G[i] - B[j]), idx = j;
        if (G[i] < B[j]) i++;
        else j++;
    }
    i = 0; j = 0;
    while (i < G.size() && j < B.size()) {
        if (g1 > llabs(G[i] - B[j])) g1 = llabs(G[i] - B[j]), idx = j;
        if (B[j] < G[i]) j++;
        else i++;
    }

    i = 0; j = 0;
    while (i < R.size() && j < B.size()) {
        if (j == idx) {
            j++; 
            continue;
        }
        if (g2 > llabs(R[i] - B[j])) g2 = llabs(R[i] - B[j]);
        if (R[i] < B[j]) i++;
        else j++;
    }
    i = 0; j = 0;
    while (i < R.size() && j < B.size()) {
        if (j == idx) {
            j++;
            continue;
        }
        if (g2 > llabs(R[i] - B[j])) g2 = llabs(R[i] - B[j]);
        if (B[j] < R[i]) j++;
        else i++;
    }
    ans = min(ans, g1 + g2);
    cout << ans << endl;
}

signed main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); //cout << fixed << setprecision(15);
    int t = 1; //cin >> t;
    while (t--) solve();
    return 0;
}


#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define int long long int
#define rep(i, a, b) for (int i = a; i < b; i++)
#define revrep(i, a, b) for (int i = a; i >= b; i--)
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))

ostream &operator<<( ostream &output, const pii &p ) { output << p.first << " " << p.second;return output; }
istream &operator>>( istream &input, pii &p ) { input >> p.first >> p.second;return input; }
template<typename T>
void inline println(vector<T> args){ for(T i: args)cout<<i<<" ";cout<<endl; }

int INF = 1e18;
int MOD = 1e9+7;



void solve()
{
    int n;cin>>n;
    map<int, int> mp;
    rep(i, 0, n) {
        int temp;cin>>temp;
        mp[temp]++;
    }
    if(n%2 == 0) {
        int first = true;
        for(auto pr: mp)
            if(pr.second%2 != 0) first = false;
        if(first) cout<<"Second";
        else cout<<"First";
    } else {
        cout<<"Second";
    }
    cout<<endl;
}


signed main()
{

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}
