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

#define st first
#define nd second
#define pb(x) push_back(x)
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int MN=(int)(5*1e5)+7;
bitset <MN> tab;
int main()
{
    BOOST
    int n;
    cin>>n;
    int a[n+1];
    int b[n];
    for(int i=0; i<n; i++) {cin>>a[i]; b[i]=a[i]; }
    sort(a,a+n);
    a[n]=0;
    ll k=a[0];
    //tab.set(1);
    tab[0]=0;
  //  for(int i=0; i<n; i++)
     //   cout<<a[i]<<' ';
    //cout<<"\n";
    for(int i=1; i<n; i++)
    {
        k+=a[i];
        if(k>a[i+1])
            tab[i]=1;
        else tab[i]=0;
    }
   // for(int i=0; i<n; i++)
    //    cout<<tab[i];
    //cout<<"\n";
    tab[n-1]=1;
    int licz=n-1;
    while(licz>0 and tab[licz-1]) licz--;
    int c=a[licz-1];
    for(int i=0; i<n; i++)
    {
        if(b[i]>c) cout<<'T';
        else cout<<'N';
    }
    return 0;

}