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
//Sylwia Sapkowska
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long LL;
typedef long double LD;
 
typedef pair<int, int> pii;
typedef pair<LL,LL> pll;
typedef pair<LD,LD> pdd;
 
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<LD> vld;
typedef vector<LL> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
 
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
 
#define rep(i, a, b) for (int i=a; i<(b); i++)
#define repd(i,a,b) for (int i = (a); i >= b; i--)
#define sz(x) (int)(x).size()
#define pb push_back
#define st first
#define nd second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define memo(x) memset(x, 0, sizeof(x))
#define debug(x) cerr << x << " "
#define PI 3.14159265359
#define INF 1e9+7

LL losuj(LL a, LL b){ 
	return a+rng()%(b-a+1);
}


void solve(){
	int n; cin >> n;
	vpii a(n);
	vll pref(n, 0LL);
	rep(i, 0, n) {
		cin >> a[i].st;
		a[i].nd = i;
	}
	sort(all(a));
	a.pb({0, INF});
	pref[0] = a[0].st;
	rep(i, 1, n) pref[i] = pref[i-1]+(LL)a[i].st;
	//for (auto x: a) debug(x.st);
	//cerr << "\n";
	//for (auto x: pref) debug(x);
	//cerr << "\n";
	vb ans(n, 0);
	repd(i, n-1, 0){
		if (pref[i] > a[i+1].st){
			ans[a[i].nd] = 1;
		} else break;
	}
	int k = 1;
	while (k < n && a[k].st == a[k-1].st) k++;
	rep(i, 0, k) ans[a[i].nd] = 0;
	
	rep(i, 0, n){
		if (ans[i]) cout << "T";
		else cout << "N";
	}
	cout << "\n";
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int t = 1;
	//cin >> t;
	while (t--) solve();
	
	return 0;
}