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
#define pb push_back
#define mp make_pair
#define fi first
#define se second 
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)
#define boost {ios_base::sync_with_stdio(false); cin.tie(); cout.tie();}

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

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector <int> vi;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
constexpr ll nax = 5e5+6969, INF = 2e9+6969;


int n;
vector <PLL> v;
vector <ll> pref;
bitset <nax> ans;

int main()
{
	scanf("%d", &n);
	v.resize(n);
	for(int i=0;i<n;i++) 
	{
		scanf("%lld", &v[i].fi);
		v[i].se = i;
	}
	sort(all(v));
	pref.resize(n+1);
	pref[0] = 0;
	for(int i=0;i<n;i++) pref[i+1] = v[i].fi + pref[i];
	if(v[0].fi < v[n-1].fi) ans[v[n-1].se] = 1;
	int pos = n - 2, small = n - 2;
	while(pos >= 0 && ans[v[pos+1].se] == 1)
	{
		while(small >= 0 && v[small].fi > v[pos].fi) small--;
		if(v[pos].fi != v[0].fi && pref[small+1] > v[pos+1].fi)
		{
			ans[v[pos].se] = 1;
		}
		pos--;
	}
	for(int i=0;i<n;i++) printf("%c", (ans[i] ? 'T' : 'N'));
	puts("");
	
	return 0;
}