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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#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)
template<class T> int size(T &&x) {
	return int(x.size());
}
template<class A, class B> ostream& operator<<(ostream &out, const pair<A, B> &p) {
	return out << '(' << p.first << ", " << p.second << ')';
}
ostream& operator<<(ostream &out, string &str) {
	for(char c: str) out << c;
	return out;
}
template<class T> auto operator<<(ostream &out, T &&x) -> decltype(x.begin(), out) {
	out << '{';
	for(auto it = x.begin(); it != x.end(); ++it)
		out << *it << (it == prev(x.end()) ? "" : ", ");
	return out << '}';
}
void dump() {}
template<class T, class... Args> void dump(T &&x, Args... args) {
	cerr << x << ";  ";
	dump(args...);
}
#ifdef DEBUG
  struct Nl{~Nl(){cerr << '\n';}};
# define debug(x...) cerr << (strcmp(#x, "") ? #x ":  " : ""), dump(x), Nl(), cerr << ""
#else
# define debug(...) 0 && cerr
#endif
mt19937_64 rng(0);
int rd(int l, int r) {
	return uniform_int_distribution<int>(l, r)(rng);
}
// end of templates

int main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	
	int n; cin >> n;
	vector<pair<int, int>> vec(n);
	REP(i, n) {
		cin >> vec[i].first;
		vec[i].second = i;
	}

	sort(vec.begin(), vec.end());

	auto check = [&](int x) {
		debug(x);
		auto it = lower_bound(vec.begin(), vec.end(), pair(x, -1));
		debug(*it);
		LL sum = x;
		for(auto itt = vec.begin(); itt != it; itt++)
			sum += itt->first;
		debug(sum);
		for(auto itt = it; itt != vec.end(); itt++) {
			if(itt == it) continue;
			if(sum <= itt->first)
				return false;
			else
				sum += itt->first;
		}
		return true;
	};

	int l = 0, r = n - 1, fir = INT_MAX;
	while(l <= r) {
		int mid = (l + r) / 2;
		if(check(vec[mid].first)) {
			fir = vec[mid].first;
			r = mid - 1;
		} else
			l = mid + 1;
	}
	debug(fir);

	for(auto &[a, b]: vec)
		swap(a, b);
	sort(vec.begin(), vec.end());
	debug(vec);

	for(auto [a, b]: vec)
		cout << (b < fir ? 'N' : 'T');
	cout << '\n';
}