1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int n, p, pref, step;
vector<int> arr;
vector<int> arr_sorted;

int main(){
	scanf("%d", &n);
	for(int i = 0; i < n; i++){
		scanf("%d", &p);
		arr.push_back(p);
	}
	arr_sorted = arr;
	sort(arr_sorted.begin(), arr_sorted.end());
	for(int i = 0; i < n - 1; i++){
		step = max(arr_sorted[i + 1] - pref, step);
		pref += arr_sorted[i];
	}
	for(auto i : arr) printf(i > step ? "T" : "N");
}