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
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>

using namespace std;

typedef vector<int> VI;
typedef long long LL;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

int main() {
	ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    if(n == 1) {
        cout << "T\n";
        return 0;
    }
    vector<pair<int, int> > sums(n);
    REP(i, n) {
        cin >> sums[i].first;
        sums[i].second = i;
    }
    string res(n, 'N');
    sort(sums.begin(), sums.end());
    vector<LL> acc(n + 1);
    for(int i = 1; i < acc.size(); i++) acc[i] = acc[i - 1] + sums[i - 1].first;
    int i = n - 1;
    while(sums[i].first > sums[0].first && (i == n - 1 || acc[i + 1] > sums[i + 1].first)) {
        res[sums[i].second] = 'T';
        i--;
    }
    cout << res << '\n';

    return 0;
}