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
89
90
// clang-format off
#include <bits/stdc++.h>

using namespace std;

#define ALL(x) (x).begin(), (x).end()

template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); }
template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); }

#ifdef LOCAL
const bool debug = true;
#else
const bool debug = false;
#define cerr if (true) {} else cout
#endif
// clang-format on

#define int long long
#define double long double

const int INF = 1e18;
const int mod = 1e9 + 7;

const int nax = 1e6;

int tab[nax];

bool foo(vector<int> v, int sr) {
	for (int i = sr; i > 0; i--) {
		swap(v[i], v[i - 1]);
	}
	
	int sum = 0;
	for (int i = 0; i + 1 < (int)v.size(); i++) {
		sum += v[i];
		
		if (sum <= v[i + 1]) return false;
	}
	
	return true;
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
	vector<int> v;

    int n;
    cin >> n;
    
    for (int i = 0; i < n; i++) {
		cin >> tab[i];
		v.push_back(tab[i]);
	}
	
	sort(ALL(v));
	
	int pocz = -1, kon = n, sr;
	while (kon - pocz > 1) {
		sr = (pocz + kon) / 2;
		if (foo(v, sr)) {
			kon = sr;
		} else {
			pocz = sr;
		}
	}
	
	v.push_back(INF);
	int tr = v[kon];
	
	for (int i = 0; i < n; i++) {
		if (tab[i] >= tr) {
			cout << "T";
		} else {
			cout << "N";
		}
	}
	
	cout << "\n";
    
    return 0;
}/*
6
2 7 1 8 2 8
 
3
5 4 4
*/