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
#if defined(EMBE_DEBUG) && !defined(NDEBUG)
#include "embe-debug.hpp"
#else
#define LOG_INDENT(...) do {} while (false)
#define LOG(...) do {} while (false)
#define DUMP(...) do {} while (false)
#endif

#include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;

namespace {
}

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

  int n;
  cin >> n;

  vector<int> data(n);
  for (auto& x: data) cin >> x;

  vector<bool> res(n);

  vector<pair<int, int>> v(n);
  for (int i = 0; i < n; ++i) {
    v[i] = {data[i], i};
  }
  sort(v.begin(), v.end());

  {
    auto i = v.begin();
    long long sum = 0;
    {
      auto j = i;
      while (j != v.end() && j->first == i->first) sum += j->first, ++j;
      i = j;
    }
    while (i != v.end()) {
      auto j = i;
      while (j != v.end() && j->first == i->first) sum += j->first, ++j;
      if (j == v.end() || sum > j->first) {
        auto k = i;
        while (k != j) res[k->second] = true, ++k;
      }
      i = j;
    }
  }
  {
    auto i = v.rbegin();
    while (i != v.rend() && res[i->second]) ++i;
    while (i != v.rend()) res[i->second] = false, ++i;
  }

  for (bool b: res) {
    cout << (b ? 'T' : 'N');
  }
  cout << endl;

  return 0;
}