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
#include "bits/stdc++.h" // Tomasz Nowak
using namespace std;     // University of Warsaw
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 << $ << "; "), ...); }(x), cerr << '\n'
#else
#define debug(...) {}
#endif

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

	int n;
	cin >> n;
	vector<int> a(n);
	for(int &ai : a)
		cin >> ai;

	vector<pair<LL, int>> sorted(n);
	REP(i, n)
		sorted[i] = {a[i], i};
	sort(sorted.begin(), sorted.end());

	vector<LL> pref(n);
	REP(i, n) {
		pref[i] = sorted[i].first;
		if(i > 0)
			pref[i] += pref[i - 1];
	}
	auto get_sum_smaller = [&](LL x) {
		auto it = upper_bound(sorted.begin(), sorted.end(), pair(x, -1));
		// debug(x, int(it - sorted.begin()));
		if(it == sorted.begin())
			return 0LL;
		return pref[int(it - sorted.begin()) - 1];
	};

	vector<int> answer(n, -1);
	REP(i, n) {
		debug(a[i], get_sum_smaller(a[i]));
		LL sum = get_sum_smaller(a[i]) + a[i];
		debug(i, a[i], sum);
		bool possible = true;
		while(sum != pref.back()) {
			LL new_sum = get_sum_smaller(sum);
			if(sum == new_sum) {
				possible = false;
				break;
			}
			sum = new_sum;
		}
		debug(i, a[i], possible);
		answer[i] = possible;
	}

	for(int x : answer)
		cout << (x ? 'T' : 'N');
	cout << '\n';
}