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
#include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const int MAX=5e5+5;
pii a[MAX];
char ans[MAX];
int pref[MAX];
int32_t main(){
  BOOST;
  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);
  for (int i=1;i<=n;i++)pref[i]=pref[i-1]+a[i].st;
  for (int i=1;i<=n;i++)ans[i]='N';
  for (int i=n;i>=1;i--){
		if (i==n){
		  if (a[1].st!=a[n].st)
				ans[a[i].nd]='T';
			else break;
		}
		else{
			if (a[i+1].st==a[i].st){
				ans[a[i].nd]='T';
			}
			else{
				if (a[1].st!=a[i].st){
					if (pref[i]>a[i+1].st)ans[a[i].nd]='T';
					else break;
				}
				else break;
			}
		}
  }
  for (int i=1;i<=n;i++)cout<<ans[i];
  return 0; 
}