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
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
#include <bits/stdc++.h> 

typedef long long int lli;

using namespace std;

#define MAX4 10010
#define MAX5 100010
#define MAX6 1000010
#define MAX 1000000100

template <typename T >
void dbg(T last)
{
  cout << last << "\n";
}

template <typename T, typename ...args>
void dbg(T current, args ...next)
{
  cout << current << ' ';
  dbg(next...);
}

//-----------------------------------------------------------------------------------------------//

int tab[MAX6];
int pre[MAX6];

bool check(int s, int n)
{
  lli x = (lli)tab[s];

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

  return true;
}

int getLower(int n)
{
  int l=0, p=n-1, s;
  int res=n;
  while (l <= p)
  {
    s = (l+p)/2;

    if (check(s, n))
    {
      res = s;
      p = s-1;
    }
    else
    {
      l = s+1;
    }
  }

  return (res == n? MAX : tab[res]);
}

void solve()
{
  int n;
  cin >> n;

  for (int i=0;i<n;i++)
  {
    cin >> tab[i];
    pre[i] = tab[i];
  }

  if (n == 1)
  {
    cout << "T";
    return;
  }

  sort(tab, tab + n);

  int lower = getLower(n);

  for (int i=0;i<n;i++)
  {
    cout << (pre[i] >= lower ? "T" : "N");
  }
}

int main()
{
  std::ios::sync_with_stdio(false);

  solve();

  return 0;
}