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
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r) for(int i=(l);i<=(r);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define ssize(x) int(x.size())
template<class A,class B>auto&operator<<(ostream&o,pair<A,B>p){return o<<'('<<p.first<<", "<<p.second<<')';}
template<class T>auto operator<<(ostream&o,T x)->decltype(x.end(),o){o<<'{';int i=0;for(auto e:x)o<<(", ")+2*!i++<<e;return o<<'}';}
#ifdef DEBUG
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<'\n';}(x)
#else
#define debug(...) {}
#endif

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int n;
	cin >> n;
	vector<pair<LL,int>> v(n);
	REP(i,n) {
		int x;
		cin >> x;
		v[i] = {x, i};
	}
	sort(v.begin(), v.end());
	vector<bool> fin(n);
	int ans = n;
	int bb = 0, ee = n - 1, ss;
	auto ok = [&](int x) {
		LL cur = v[x].first;
		REP(i,n) {
			if (i == x) continue;
			if (v[i].first >= cur) return false;
			cur += v[i].first;
		}
		return true;
	};
	while (bb <= ee) {
		ss = (bb + ee) / 2;
		if (ok(ss)) {
			ans = min(ans, ss);
			ee = ss - 1;
		}
		else {
			bb = ss + 1;
		}
	}
	REP(i,n) {
		if (i >= ans) {
			fin[v[i].second] = true;
		}
	}
	REP(i,n) {
		if (fin[i]) cout << 'T';
		else cout << 'N';
	}
	cout << '\n';
}