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
#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

const int N=500007;

pair<ll,int>a[N];
bool ans[N];


int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].st;
        a[i].nd=i;
    }
    sort(a+1,a+n+1);
    int last=0;
    ll sum=0;
    for(int i=1;i<=n;i++)
    {
        sum+=a[i].st;
        if(sum<=a[i+1].st) last=i;
        if(a[i].st==a[i-1].st&&last==i-1) last=i;
    }
    for(int i=last+1;i<=n;i++) ans[a[i].nd]=1;
    for(int i=1;i<=n;i++)
    {
        if(ans[i]) cout<<'T';
        else cout<<'N';
    }

    return 0;
}