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

#define fi first
#define se second
#define p_b push_back
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define all(x) x.begin(),x.end()
#define sset ordered_set

#define sqr(x) (x)*(x)
#define pw(x) (1ll << (x))
#define sz(x) (int)x.size()
#define fout(x) {cout << x << "\n"; return; }

using namespace std;
typedef long long ll;
typedef long double ld;
const int MAXN = 1e5;
const int M = pw(16);
const long long mod = 1e9 + 7;
const int N = 5e5;
const ll inf = 1e18;
template <typename T> void vout(T s){cout << s << endl;exit(0);}



int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;

    cin >> n;


    string s;

    vector <pll> a;

    for(int i = 0; i < n; i++){
        int x;
        cin >> x;
        a.p_b({x, i});
        s += 'N';
    }

    sort(all(a));

    ll sum = 0, idx = 0;
    for(int i = 0; i < n; i++){
        if(sum <= a[i].fi) idx = i;
        if(i > 0 && a[i].fi == a[i - 1].fi && a[i].fi == a[0].fi) idx = i + 1;
        sum += a[i].fi;
    }

    for(int i = idx; i < n; i++) s[a[i].se] = 'T';

    cout << s << "\n";

    return 0;
}