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
#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < n; i++)
#define pb push_back
#define debug(x) cout << #x << " " << x << endl
#define all(x) x.begin(),x.end()
#define ll long long
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vll vector<ll>
#define vvll vector<vll>
#define ld long double
#define ull unsigned long long
#define vull vector<ull>
#define fi first
#define se second
#define PII pair<int,int>
#define vPII vector<PII>
#define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());}
#define int128 __int128

ll a[500005], b[500005];
int n;
bool f(int cur){
    ll waga = b[cur];
    for(int i = 0; i < n; i++){
        if(i == cur) continue;
        if(b[i] >= waga) return 0;
        waga += b[i];
    }
    return 1;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
//    cout << setprecision(16) << fixed;
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int tt = 1;
//    cin >> tt;
    while(tt--) {
        cin >> n;
        rep(i,n){
            cin >> a[i];
            b[i] = a[i];
        }
        sort(b,b+n);
        int l = 0, r = n-1;
        if(b[l] == b[r]){
            rep(i,n) cout << 'N';
            return 0;
        }
        while(l < r){
            int m = (l+r)/2;
            if(f(m)){
                r = m;
            }else{
                l = m+1;
            }
        }
        ll ans = b[l];
        rep(i,n){
            if(a[i] >= ans) cout << 'T';
            else cout << 'N';
        }
    }
}