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
#include <stdio.h>
#include <vector>
#include <map>
#include <unordered_set>
#include <queue>
#include <set>
#include <unordered_map>
#include <math.h>
#include <limits.h>
#include <algorithm>
#include <functional>
#include <iterator>
#include <algorithm>
#include <string>
#include <iostream>

using namespace std;

#define pb push_back
#define mp make_pair

typedef long long ll;
typedef unsigned long long ull;

using namespace std;


int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  int n, ai;
  cin >> n;

  vector<pair<int,int>> nums;
  vector<bool> ans;
  vector<ll> psum;

  for (int i=0; i<n; ++i) {
    ans.pb(false);
    cin >> ai;
    nums.pb(make_pair(ai, i));
  }

  sort(nums.begin(), nums.end());

  ll suma = 0;
  for (int i=0; i<n; ++i) {
    suma += nums[i].first;
    psum.pb(suma);
  }

  int fst = 1;
  while (fst < nums.size() && nums[fst].first == nums[fst-1].first) fst++;

  int prevSize = -1;
  for (int i=nums.size()-1; i >= fst; i--) {
    if (psum[i-1] + nums[i].first > prevSize) {
      ans[nums[i].second] = true;
    } else {
      break;
    }
    prevSize = nums[i].first;
  }

  for (int i=0; i<n; ++i) {
    if (ans[i] == false) cout << 'N';
    else cout << 'T';
  }
  cout << endl;

  return 0;
}