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
81
82
83
84
85
86
87
88
89
90
// Daniel Grzegorzewski
// while (clock()<=69*CLOCKS_PER_SEC)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")

#define MP make_pair
#define PB push_back
#define ST first
#define ND second
#define int long long

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

//X.find_by_order(k); - zwraca iterator na k-ty element (numeracja od zerowego)
//X.order_of_key(k); - zwraca liczbę elementów ostro mniejszych niż k

typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef long long LL;

void init_ios() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
}

auto random_address = [] { char *p = new char; delete p; return uint64_t(p); };
 
const uint64_t SEED = chrono::steady_clock::now().time_since_epoch().count() * (random_address() | 1);
mt19937_64 rng(SEED);

const int N = 5*(int)1e5 + 3;

int n;
VII v;
bool ok[N];

bool can(int id) {
  int cur = v[id].ST;
  for (int i = 0; i < n; ++i) {
    if (i == id)
      continue;
    if (cur <= v[i].ST)
      return false;
    cur += v[i].ST;
  }
  return true;
}

signed main() {
  init_ios();
  cin >> n;
  for (int i = 0; i < n; ++i) {
    int x;
    cin >> x;
    v.PB({x, i});
  }
  sort(v.begin(), v.end());
  if (v[0].ST == v[n-1].ST) {
    for (int i = 0; i < n; ++i)
      cout<<"N";
    cout<<"\n";
    return 0;
  }
  int x1 = 0, x2 = n-1, x3;
  while (x2-x1 > 1) {
    x3 = (x1+x2)/2;
    if (can(x3))
      x2 = x3;
    else
      x1 = x3;
  }
  for (; x2 < n; ++x2)
    ok[v[x2].ND] = true;
  for (int i = 0; i < n; ++i) {
    if (ok[i])
      cout<<"T";
    else
      cout<<"N";
  }
  cout<<"\n";
}