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
#include <bits/stdc++.h>
using namespace std;
#define PII pair<int, int>
#define VI vector<int>
#define VPII vector<PII>
#define LL long long
#define LD long double
#define f first
#define s second
#define MP make_pair
#define PB push_back
#define endl '\n'
#define ALL(c) (c).begin(), (c).end()
#define SIZ(c) (int)(c).size()
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i)
#define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i)
 
#define sim template<class n
sim, class s> ostream & operator << (ostream &p, pair<n, s> x)
{return p << "<" << x.f << ", " << x.s << ">";}
sim> auto operator << (ostream &p, n y) ->
typename enable_if<!is_same<n, string>::value, decltype(y.begin(), p)>::type 
{int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";}
void dor() {cerr << endl;}
sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);}
sim, class s> void mini(n &p, s y) {if(p>y) p = y;}
sim, class s> void maxi(n &p, s y) {if(p<y) p = y;}
// #ifdef DEB
#define debug(...) dor(__FUNCTION__, ":", __LINE__, ": ", __VA_ARGS__)
// #else
// #define debug(...)
// #endif 
 
#define I(x) #x " =", (x), " "
#define A(a, i) #a "[" #i " =", i, "] =", a[i], " "

using namespace std;

const int MXN = 1e6+5;
int in[MXN];
int in2[MXN];
int n;
bool check(int idx)
    {
    LL val = in2[idx];
    debug(idx, val);
    FORD(i, n, 1)
        {
        if(i == idx)continue;
        if(in2[i] < val)val += in2[i];
        else return 0;
        }
    return 1;
    }

int main()
    {
    ios_base::sync_with_stdio(0);
    cin >> n;
    FOR(i, 1, n)
        {
        cin >> in[i];
        in2[i] = in[i];
        }
    sort(in2+1, in2+n+1);
    reverse(in2+1, in2+n+1);
    int done = 0;
    FORD(i, 20, 0)
        {
        if((done + (1 << i)) <= n && check(done + (1 << i)))
            {
            done += 1 << i;
            }
        }
    in2[0] = 1.1e9;
    debug(I(done));
    FOR(i, 1, n)
        {
        cout << (in[i] >= in2[done] ? 'T' : 'N'); 
        }
    cout << endl;
    }