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
#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(int i = (a); i >= (b); --i)
#define RI(i,n) FOR(i,1,(n))
#define REP(i,n) FOR(i,0,(n)-1)
#define mini(a,b) a=min(a,b)
#define maxi(a,b) a=max(a,b)
#define pb push_back
#define st first
#define nd second
#define sz(w) (int) w.size()
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<pii, int> para;
const ll inf = 1e18 + 7;
const ll maxN = 1e6 + 5;
const ll MOD = 1e9 + 7;

bool check(int ind, vector<pll>& a) {
    ll sum = a[ind].st;
    REP(i, sz(a)) {
        if (ind == i) continue;
        if (a[i].st >= sum) return false;
        sum += a[i].st;
    }
    return true;
}
// sprawdz MODULO!
int main() {
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n; cin >> n;
	vector<pll> a(n);
	REP(i, n) {
	    cin >> a[i].st;
	    a[i].nd = i;
	}
	sort(a.begin(), a.end());
	vector<bool> ans(n);
	
	int l = 0, r = n - 1;
	while (l < r) {
	    int m = (l + r) / 2;
	    // cout << "check " << l << " " << m << " " << r << endl;
	    if (check(m, a)) {
	        r = m;
	    } else {
	        l = m + 1;
	    }
	}
	// cout << r << endl;
	if (!check(r, a)) r++;
	REP(i, n) {
	    if (i >= r) ans[a[i].nd] = 1;
	}
	REP(i, n) {
	    if (ans[i]) cout << 'T';
	    else cout << 'N';
	}
	cout << endl;
	return 0;
}