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
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=501000;
PII p[N];
int n;
char ret[N];
int main() {
	scanf("%d",&n);
	rep(i,1,n+1) {
		scanf("%d",&p[i].fi);
		p[i].se=i-1;
	}
	sort(p+1,p+n+1);
	int l=0,r=n+1;
	while (l+1<r) {
		int md=(l+r)>>1;
		auto check=[&](int md) {
			ll s=p[md].fi;
			rep(i,1,n+1) {
				if (i==md) continue;
				if (s<=p[i].fi) return false;
				s+=p[i].fi;
			}
			return true;
		};
		if (check(md)) r=md; else l=md;
	}
	rep(i,1,n+1) if (i>=r) ret[p[i].se]='T'; else ret[p[i].se]='N';
	puts(ret);
}