#include #define mp make_pair #define fi first #define se second #define debug(x) cerr << #x << " = " << (x) << endl #define EPS 1e-9 #define PI acos(-1.0) using namespace std; void test() { cerr << endl; } template void test(T x, Args... args) { cerr << x << " "; test(args...); } typedef long long ll; typedef pair pii; typedef pair pll; const int MAXN = (int)1e5 + 10; const int MOD = 998244353; const int INF = 1e9; ll a[MAXN], sum[MAXN]; void Main() { int n; cin >> n; vector a(n), vis(n); for (int i = 0; i < n; i++) { cin >> a[i]; a[i]--; } int cnt = 0; for (int i = 0; i < n; i++) { if (vis[i]) continue; cnt++; vis[i] = 1; if (a[i] != i) { int pos = i; while(a[pos] != pos && !vis[a[pos]]) { pos = a[pos]; vis[pos] = 1; } } } if (cnt > 50) cout << "First\n"; else cout << "Second\n"; } int main() { #ifdef BanFcc freopen("in.txt", "r", stdin); /// freopen("out.txt", "w", stdout); #else ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0); cout << fixed << setprecision(10); #endif int T = 1; cin >> T; for (int ca = 1; ca <= T; ca++) { // cout << "Case #" << ca << ": "; Main(); } return 0; }