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
#include<bits/stdc++.h>
#define VAR(i,n) __typeof(n) i = (n)
#define loop(i,j,s) for(int i=j;i<s;i++)
#define loopback(i,j,s) for(int i=j;i>=s;i--)
#define foreach(i,c) for(VAR(i,(c).begin());i!=(c).end();i++)
#define pln( x ) cout << x << "\n"
#define ps( x ) cout << x << " "
#define entr cout << "\n"
#define pcnt(i) __builtin_popcount(i)
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define SIZE(c) (c).size()
#define ALL(c) (c).begin(), (c).end()
using namespace std;
typedef vector<ll> vi;
typedef pair<ll,ll> pii;
typedef vector<vector<int> > VVI;
const int INFTY=20000000;
const int MAX=500100;
const int MOD=10000000;

void coutTab(int* tab,int n){
	loop(i,0,n){
		cout<<tab[i]<<" ";
	}
	cout<<"\n";
}

template<class T> void coutVec(vector<T> tab){
	for(T t : tab){
		cout<<t<<" ";
	}
	cout<<"\n";
}
//------------------------------------------
int main(){
	ios_base::sync_with_stdio(0);
    int n;
    cin>>n;
    vi a(n);
    loop(i,0,n) cin>>a[i];
    map<ll, ll> b;
    loop(i,0,n) {
        b[a[i]]++;
    }
    vector<pii> c;
    for(auto a : b) { 
        c.pb({a.ff, a.ss}); 
    }
    sort(ALL(c));

    int cs = c.size();
    if(cs == 1) {
        loop(i,0,n) cout<<"N";
        entr;
        return 0;
    }

    ll S=0;
    loop(i,0,cs-1) {
        S += c[i].ff*c[i].ss;
    }
    ll r=c[cs-1].ff;
    loopback(i,cs-2,1) {
        S -= c[i].ff*c[i].ss;
        if(S + c[i].ff*c[i].ss > c[i+1].ff) {
            r=c[i].ff;
        } else {
           break;
        }
    } 
    loop(i,0,n) {
        if(a[i]>=r) cout<<"T";
        else cout<<"N";
    }
    entr;
}