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
#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
#include <assert.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
#define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
#define es(x,e) (int e=fst[x];e;e=nxt[e])
#define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
#define SZ 666666
int n,a[SZ],b[SZ];
ll su[SZ];
int main()
{
	scanf("%d",&n);
	ll rs=0;
	for(int i=1;i<=n;++i) scanf("%d",a+i),rs+=a[i];
	for(int i=1;i<=n;++i) b[i]=a[i];
	sort(b+1,b+1+n);
	for(int i=1;i<=n;++i) su[i]=su[i-1]+b[i];
	for(int i=1;i<=n;++i) {
		auto gs=[&](ll x) {
			x=min(x,(ll)2e9);
			ll cs=su[lower_bound(b+1,b+1+n,x)-b-1];
			if(a[i]<x) cs-=a[i];
			return cs;
		};
		ll s=0;
		while(1) {
			ll w=gs(s+a[i]);
//			cerr<<s<<":"<<w<<" ("<<a[i]<<")?\n";
			if(w==s) break;
			s=w;
		}
		putchar("NT"[s+a[i]==rs]);
	}
	puts("");
}