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
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define PB push_back
#define EB emplace_back
#define FI first
#define SE second
#define umap unordered_map
#define uset unordered_set
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vpii vector<pii>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ALL(X) (X).begin(),(X).end()
#ifndef DEBUG
#define endl (char)10
#endif
using namespace std;
using ll = long long;
using ld = long double;

template <class T>
istream& operator>> (istream& is, vector<T>& vec){
    FOR(i,0,vec.size()) is >> vec[i];
    return is;
}
template <class T>
ostream& operator<< (ostream& os, vector<T>& vec){
    for(auto& t : vec) os << t << " ";
    return os;
}

bool can(int t, vi& W){
    ll rozm = W[t];
    FOR(i,0,W.size()-1){
        if(i == t) continue;
        if (W[i] >= rozm) return false;
        rozm += W[i];
    }
    return true;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vi V(n);
    cin >> V;
    vi W(n);
    FOR(i,0,n) W[i] = V[i];
    sort(ALL(W));
    W.PB(2123456789);
    int b = 0, e = n + 1;
    while(b < e){
        int t = (b + e) / 2;
        if (!can(t, W)) b = t + 1;
        else e = t;
    }
    FOR(i,0,n) cout << (V[i] < W[b] ? 'N' : 'T');
    cout << endl;
}