func_code_string: #include <bits/stdc++.h>   using namespace std;   #pragma GCC optimize( Ofast )   int ah = 911382323;   int bh = 972663749;   template <typename F, typename S>   ostream &operator<<(ostream &os, const pair<F, S> &p) {     return os <<  (  << p.first <<  ,   << p.second <<  ) ;   }   template <typename T>   ostream &operator<<(ostream &os, const vector<T> &v) {     os <<  { ;     typename vector<T>::const_iterator it;     for (it = v.begin(); it != v.end(); it++) {       if (it != v.begin()) os <<  ,  ;       os << *it;     }     return os <<  } ;   }   template <typename T>   ostream &operator<<(ostream &os, const set<T> &v) {     os <<  [ ;     typename set<T>::const_iterator it;     for (it = v.begin(); it != v.end(); it++) {       if (it != v.begin()) os <<  ,  ;       os << *it;     }     return os <<  ] ;   }   template <typename F, typename S>   ostream &operator<<(ostream &os, const map<F, S> &v) {     os <<  [ ;     typename map<F, S>::const_iterator it;     for (it = v.begin(); it != v.end(); it++) {       if (it != v.begin()) os <<  ,  ;       os << it->first <<   =   << it->second;     }     return os <<  ] ;   }   long long dx[8] = {1, -1, 0, 0, 1, 1, -1, -1};   long long dy[8] = {0, 0, 1, -1, 1, -1, 1, -1};   int32_t main() {     ios::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     long long(t);     cin >> (t);     while ((t)--) {       long long n;       cin >> n;       vector<long long> v(n);       for (long long i = 0; i < n; i++) cin >> v[i];       long long ind = 0;       while (ind < n && v[ind] == 1) ind++;       if (ind == n) {         if (n % 2)           cout << ( First ) <<   n ;         else           cout << ( Second ) <<   n ;       } else {         if (ind % 2 == 0)           cout << ( First ) <<   n ;         else           cout << ( Second ) <<   n ;       }     }   }   