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
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

typedef uint32_t ul;
typedef int32_t l;
typedef uint64_t ull;
typedef int64_t ll;

const l INF = 1000000000 + 9;
const ll MOD = 123456789;
const l PRIME = 200003;
const ll L_INF = 1000000000000000000LL + 7;
const double EPS = 1e-5;

#define FOR(x, y, z) for (l z = x; z < y; z++)
#define FORE(x, y, z) for (l z = x; z <= y; z++)
#define FORD(x, y, z) for (l z = x; z > y; z--)
#define FORDE(x, y, z) for (l z = x; z >= y; z--)
#define REP(x, y) for (l y = 0; y < x; y++)
#define ALL(...) (__VA_ARGS__).begin(), (__VA_ARGS__).end()

#define PF push_front
#define POF pop_front
#define PB push_back
#define POB pop_back
#define MP make_pair
#define FS first
#define SC second

l n;
vector<ll> fish, fish_sorted;

bool check(ll pos)
{
    ll w = fish_sorted[pos];

    REP(n, i)
    {
        if(i == pos)
            continue;

        else
        {
            if(w <= fish_sorted[i])
                return false;
            w += fish_sorted[i];
        }
    }
    
    return true;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    cin >> n;
    REP(n, i)
    {
        l a;
        cin >> a;
        fish.PB(a);
    }

    fish_sorted = fish;
    sort(ALL(fish_sorted));
    ll lf = 0, rt = n;

    while(lf < rt)
    {
        ll mid = (lf+rt)/2LL;
        if(check(mid))
            rt = mid;
        else lf = mid+1;
    }

    rt = (rt == n ? 1e+9+5 : fish_sorted[rt]);

    REP(n, i)
        cout << (fish[i] >= rt ? 'T' : 'N');
}