1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <bits/stdc++.h>
using namespace std;
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef pair<ll, int> PILL;
typedef pair<ll, ll> PLL;
 
const int MAX_N = 5e5+5;
const int M = 3e4+5;
const ll INF = (ll)(1e18);
const int inf = 1e9;
const ll MOD = 1000000007LL;

int n;
pair<ll, int> a[MAX_N];
bool can_win[MAX_N];
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
			
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i].first;
		a[i].second = i;
	}
	
	sort(a, a + n);
	
	int block = 0;
	ll sum = 0LL;
	
	for (int i = 0; i < n; i++) {
		sum += a[i].first;
		if (i < n-1 && sum <= a[i+1].first) block = i + 1;
		if (i > 0 && a[i].first == a[0].first) block = i + 1;
	}
	
	for (int i = block; i < n; i++) {
		can_win[a[i].second] = true;
	}
	
	for (int i = 0; i < n; i++) {
		if (can_win[i]) cout << 'T';
		else cout << 'N';
	}
	
	cout << '\n';
	
    return 0;
}