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
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <stack>

using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
#define MP make_pair
#define FOR(v,p,k) for(int v=(p);v<=(k);++v)
#define FORD(v,p,k) for(int v=(p);v>=(k);--v)
#define REP(i,n) for(int i=0;i<(n);++i)
#define VAR(v,i) __typeof(i) v=(i)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define SIZE(x) (int)x.size()
#define ALL(c) c.begin(),c.end()

#define ODD(x) ((x)%2)
#define EVEN(x) (!(ODD(x)))


int main() {
    VI orig;
    int n;
    scanf("%d\n", &n);
    orig.reserve(n);
    REP(i, n) {
        int s;
        scanf("%d", &s);
        orig.PB(s);
    }
    VI ordered = orig;
    sort(ALL(ordered));
    vector<PII> cnts;
    cnts.reserve(n);
    int prev = -1, cnt = 0;
    REP(i, n) {
        int s = ordered[i];
        if ((i > 0) && (prev != s)) {
            cnts.PB(MP(prev, cnt));
            cnt = 0;
        }
        prev=s;
        cnt++;
        if (i == n - 1) {
            cnts.PB(MP(prev, cnt));
        }
    }
    
    int max_cant = 0;
    if (n > 1) {
        max_cant = cnts[0].ST;
    }
    LL eaten = ((LL)cnts[0].ST) * cnts[0].ND;
    FOR(i, 1, cnts.size()-1) {
        int s = cnts[i].ST;
        int cnt = cnts[i].ND;
        if (s >= eaten) {
            max_cant = cnts[i-1].ST;
        }
        eaten += ((LL)s) * cnt;
    }

    REP(i, n) {
        printf("%c", (orig[i] > max_cant) ? 'T' : 'N');
    }
    return 0;
}