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
#include <bits/stdc++.h>
#define FOR(i, n) for(int i = 0; i < (n); ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define TRAV(i, a) for(auto & i : (a))
#define SZ(x) ((int)(x).size())
#define X first
#define Y second
#define PR std::pair
#define MP std::make_pair
typedef long long ll;
typedef std::pair<int, int> PII;
typedef std::vector<int> VI;

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(0);

	int n;
	std::cin >> n;
	VI A(n);
	FOR(i, n) std::cin >> A[i];
	std::map<int, int> map;
	FOR(i, n) map[A[i]]++;

	ll sum = 0;
	int from = 0;
	TRAV(pr, map){
		if(pr.X >= sum){
			from = pr.X;
		}
		sum += 1ll * pr.X * pr.Y;
	}

	std::string ans;
	FOR(i, n) ans.push_back((A[i] > map.begin()->X && A[i] >= from ? 'T' : 'N'));
	std::cout << ans << "\n";

	return 0;
}