// Example program
#include <iostream>
#include <algorithm>

#define MAXN 500003

int n;
long long a_old[MAXN];
long long a[MAXN];
long long last = 1000000005LL;

bool can_be(int s_index) {
    long long cur_sum = a[s_index];
    for (int i = 0; i < n; i++) {
        if (i != s_index) {
            if (a[i] >= cur_sum) {
                return false;   
            }
            cur_sum += a[i];
        }
    }
    return true;
}

int main()
{
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%lld", &a[i]);   
    a_old[i] = a[i];
  }
  std::sort(a, a+n);
  
  int b = 0, e = (n-1);
  while (b <= e) {
    int mid = (b + e) / 2;
    if (can_be(mid)) {
        last = a[mid];
        e = mid - 1;
    } else {
        b = mid + 1;   
    }
  }

    for (int i = 0; i < n; i++) { 
        if (a_old[i] >= last) {
            printf("T");   
        }
        else {
            printf("N");   
        }
}
printf("\n");
}