import sys
input=sys.stdin.readline
def solve():
n=int(input())
a,b,c=0,0,0
l=list(map(int, input().split()))
for i in range(n):
if l[i]!=(i+1) and l[i]!=(n-i):
b+=1
elif l[i]!=(i+1):
a+=1
elif l[i]!=(n-i):
c+=1
if c>=(a+b):
print('First')
elif a>b+c:
print('Second')
else:
print('Tie')
for _ in range(int(input())):
solve()#include <iostream>
#include <fstream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
using namespace std;
// ifstream fin ("input");
int t;
int n;
int arr[1000000];
int a;
int main(){
cin >> t;
for(int i = 0; i < t; i ++){
cin >> n;
int firstCount = 0;
int secondCount = 0;
int a;
bool oddMiddle = false;
for(int j = 0; j < n; j ++){
cin >> a;
if(n % 2 == 1 && j == n / 2 && a == j + 1){//odd middle
oddMiddle = 1;
continue;
}
if(a == j + 1){
firstCount ++;
}
if(a == n - j){
secondCount ++;
}
}
if((n + 1 - oddMiddle) / 2 <= firstCount){
cout << "First\n";
}else if(n / 2 + 1 <= secondCount){
cout << "Second\n";
}else{
cout << "Tie\n";
}
}
}MATCHES Playing with Matches | HRDSEQ Hard Sequence |
DRCHEF Doctor Chef | 559. Maximum Depth of N-ary Tree |
821. Shortest Distance to a Character | 1441. Build an Array With Stack Operations |
1356. Sort Integers by The Number of 1 Bits | 922. Sort Array By Parity II |
344. Reverse String | 1047. Remove All Adjacent Duplicates In String |
977. Squares of a Sorted Array | 852. Peak Index in a Mountain Array |
461. Hamming Distance | 1748. Sum of Unique Elements |
897. Increasing Order Search Tree | 905. Sort Array By Parity |
1351. Count Negative Numbers in a Sorted Matrix | 617. Merge Two Binary Trees |
1450. Number of Students Doing Homework at a Given Time | 700. Search in a Binary Search Tree |
590. N-ary Tree Postorder Traversal | 589. N-ary Tree Preorder Traversal |
1299. Replace Elements with Greatest Element on Right Side | 1768. Merge Strings Alternately |
561. Array Partition I | 1374. Generate a String With Characters That Have Odd Counts |
1822. Sign of the Product of an Array | 1464. Maximum Product of Two Elements in an Array |
1323. Maximum 69 Number | 832. Flipping an Image |