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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#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 MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, m, a;
char slowo[1000007];
vector <long long> v;
long long tab[1000007];

int solve()
{
    scanf("%d", &n);
    forr(i, n)
    {
        scanf("%lld", &tab[i]);
        v.PB(tab[i]);
    }

    sort(v.begin(), v.end());

    int ok = 0, pocz = 0;
    long long suma = 0;
    while(v[pocz] == v[0])
    {
        suma += v[pocz];
        pocz++;
    }
    ok = v[pocz-1];

    FOR(i, pocz, n-1)
    {
        suma += v[i];
        if(i<n-1 && suma <= v[i+1])
            ok = v[i];
//        cout << i << " - suma: " << suma << endl;
    }

//    cout << "ok: " << ok << endl;

    forr(i, n)
        slowo[i] = tab[i] <= ok ? 'N' : 'T';

    printf("%s\n", slowo);

    return 0;
}

int main()
{
    solve();

    return 0;
}