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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define PPC(x) __builtin_popcountll(x)
#define MSB(x) (63 - __builtin_clzll(x))
#define LSB(x) __builtin_ctz(x)
#define ARG(x, i) (get<i>(x))
#define ithBit(m, i) ((m) >> (i) & 1)
#define pb push_back
#define ft first
#define sd second
#define kw(a) ((a) * (a))
#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std; 

template <typename T1, typename T2> inline void remin(T1& a, T2 b) { a = min(a, (T1)b);	}
template <typename T1, typename T2> inline void remax(T1& a, T2 b) { a = max(a, (T1)b);	}
 
const int maxN = 1 << 19;
const long long INF = 1'0000'0000'0000'0000;

pair <int, int> T[maxN];
char out[maxN];

void solve()
{
	int n;
	scanf ("%d", &n);
	
	FOR(i, 1, n+1)
		scanf ("%d", &T[i].ft), T[i].sd = i;
	sort(T, T+n+1);
	
	int a = 1, b = n+1;
	while (b-a > 1)
	{
		int c = (a + b) / 2;
		long long x = T[c].ft;
		bool ok = true;
		FOR(i, 1, n+1) if (i != c)
		{
			if (x <= T[i].ft)
				ok = false;
			x += T[i].ft;
		}
		(ok ? b : a) = c;
	}
	FOR(i, 1, n+1)
		out[T[i].sd] = i < b ? 'N' : 'T';
		
	printf("%s\n", out+1);
}
 
int main()
{
	int t = 1;
	//scanf ("%d", &t);
	FOR(tid, 1, t+1)
	{
		//printf("Case #%d: ", tid);
		solve();
	}
	return 0;
}