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
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef double K;
constexpr int INF = 0x3f3f3f3f;

#define FOR(i, b, e) for(int i = (b); i < (e); i++)
#define TRAV(x, a) for(auto &x: (a))
#define SZ(x) ((int)(x).size())
#define PB push_back
#define X first
#define Y second

bool check(int ind, vi& vec) {
	ll akt = vec[ind];
	FOR(i, 0, SZ(vec)) {
		if(i == ind) continue;
		if(vec[i] < akt) akt += vec[i];
		else return false;
	}
	return true;
}

void solve() {
	int n;
	cin >> n;
	vi vec(n);
	TRAV(x, vec) cin >> x;
	vi vec2 = vec;
	sort(vec.begin(), vec.end());
	int l = -1, r = SZ(vec), mid;
	while(l + 1 < r) {
		mid = (l + r) / 2;
		if(check(mid, vec)) r = mid;
		else l = mid;
	}
	int ans = (r == SZ(vec) ? INF : vec[r]);
	TRAV(x, vec2) cout << (x < ans ? 'N' : 'T');
	cout << '\n';
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	// int tt; cin >> tt;
	// FOR(te, 0, tt) {
	// 	// cout << "Case #" << te + 1 << ": ";
	// 	solve();
	// }
	solve();
	return 0;
}