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
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#ifdef LOC
#include "debuglib.h"
#else
#define deb(...)
#define DBP(...)
#endif
using namespace std;
using   ll         = long long;
using   Vi         = vector<int>;
using   Pii        = pair<int, int>;
#define pb           push_back
#define mp           make_pair
#define x            first
#define y            second
#define rep(i, b, e) for (int i = (b); i < (e); i++)
#define each(a, x)   for (auto& a : (x))
#define all(x)       (x).begin(), (x).end()
#define sz(x)        int((x).size())

int main() {
	cin.sync_with_stdio(0); cin.tie(0);
	cout << fixed << setprecision(12);

	int n; cin >> n;
	Vi elems(n);
	each(e, elems) cin >> e;

	Vi sorted = elems;
	sort(all(sorted));

	int b = 0, e = n+1;

	while (b+1 < e) {
		int m = (b+e-1) / 2;
		ll cur = sorted[m];
		bool seen = 0, ok = 1;

		each(v, sorted) {
			if (v == sorted[m]) {
				if (!seen) {
					seen = 1;
					continue;
				}
			}
			if (v >= cur) {
				ok = 0;
				break;
			}
			cur += v;
		}

		(ok ? e : b) = m+1;
	}

	sorted.pb(INT_MAX);
	each(v, elems) cout << "NT"[v >= sorted[b]];
	cout << '\n';
	return 0;
}