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
74
75
76
77
78
79
80
// Patryk Jędrzejczak

#include <bits/stdc++.h>

using namespace std;

#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a, b) for(int i = b - 1; i >= a; --i)
#define EB emplace_back
#define MP make_pair
#define ST first
#define ND second
#define S size
#define RS resize
#define endl '\n'
#define L long long

template<class T> using V = vector<T>;

bool can_be_king(V<L>& a, int n, int s) {
  L weight = a[s];

  for (int i = 0; i < n; i++) {
    if (i != s) {
      if (weight <= a[i]) {
        return false;
      }
      else {
        weight += a[i];
      }
    }
  }

  return true;
}

int bin_search(V<L>& a, int n) {
  int l = 0, r = n - 1;

  while (l < r) {
    int s = (l + r) / 2;
    if (can_be_king(a, n, s)) {
      r = s;
    }
    else {
      l = s + 1;
    }
  }

  return can_be_king(a, n, l) ? a[l] : 1e9 + 1;
}

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

  int n;
  cin >> n;

  V<L> a(n), b(n);
  REP(i, n) {
    cin >> a[i];
    b[i] = a[i];
  }

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

  int lowest_weight = bin_search(a, n);

  REP(i, n) {
    if (b[i] >= lowest_weight) {
      cout << 'T';
    }
    else {
      cout << 'N';
    }
  }
}