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
/*
 *  Copyright (C) 2021  Paweł Widera
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details:
 *  http://www.gnu.org/licenses/gpl.html
 */
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;


int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n, weight;
	cin >> n;

	vector<int> weights;
	weights.reserve(n);

	vector<int> indices;
	indices.reserve(n);

	for (int i = 0; i < n; ++i) {
		cin >> weight;
		weights.push_back(weight);
		indices.push_back(i);
	}

	// index sort weights
	sort(indices.begin(), indices.end(),
		[&](int a, int b){ return weights[a] < weights[b]; });

	int threshold = 0;
	long long sum = weights[indices[0]];

	for (int i = 1; i < n; ++i) {
		// gained weight too small to eat current catfish
		if (sum <= weights[indices[i]]) {
			threshold = weights[indices[i - 1]];
		}
		sum += weights[indices[i]];
	}

	for (auto weight: weights) {
		if (weight > threshold) {
			cout << "T";
		} else {
			cout << "N";
		}
	}
	cout << endl;
	return 0;
}