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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <cassert>
#include <limits.h>

using namespace std;

typedef long long LL;
typedef long double LD;

typedef vector<int> VI;
typedef pair<int,int> PII;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(VAR(i,a);i<=(b);++i)
#define FORD(i,a,b) for(VAR(i,a);i>=(b);--i)
#define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define VAR(a,b) __typeof(b) a=(b)
#define SIZE(a) ((int)((a).size()))
#define ALL(x) (x).begin(),(x).end()
#define CLR(x,a) memset(x,a,sizeof(x))
#define ZERO(x) memset(x,0,sizeof(x))
#define S(t,i) scanf("%" ## t, &i)
#define SI(i) scanf("%d", &i)

const int INF=INT_MAX;
const int MAXN=500000+5;

int n;
int a[MAXN];
int as[MAXN];
long long int s[MAXN];

int compare_ints(const void* a, const void* b)
{
    return *(const int*)a - *(const int*)b;
}

bool canBecomeKing(int i) {
    int l = i;
    while (true) {
//        long long int new_weight = s[i] + as[i];
        long long int new_weight = as[i] != as[1] ? s[i+1] : as[i];
        int r = n+1;
        
        while (r > l+1) {
            int k = (l+r)/2;
            if (new_weight <= as[k]) {
                r = k;
            } else {
                l = k;
            }
        }
        
        if (l == i) {
            break;
        }
        i = l;
    }
    
    return l == n;
}

int main() {
    ios_base::sync_with_stdio(0);
    
    SI(n);
    
    FOR(i, 1, n) {
        SI(a[i]);
        as[i] = a[i];
    }
    as[n+1] = INF;
    qsort(as+1, n, sizeof(as[0]), compare_ints);
    if (as[1] == as[n]) {
        REP(i, n) {
            printf("N");
        }
        printf("\n");
        return 0;
    }
        
    long long int prev_sum = as[1];
    FOR(i, 2, n+1) {
        if (as[i] == as[i-1]) {
            prev_sum += as[i];
            s[i] = s[i-1];
        } else {
            s[i] = s[i-1] + prev_sum;
            prev_sum = as[i];
        }
    }
    
//    FOR(i, 1, n) {
//        printf("%d %lld \n", as[i], s[i]);
//    }
    
    int l=0;
    int r=n+1;
    do {
        int k = (l+r)/2;
        if (canBecomeKing(k)) {
            r = k;
        } else {
            l = k;
        }
    } while (r > l+1);
    
    FOR(i, 1, n) {
        if (a[i] >= as[r]) {
            printf("T");
        } else {
            printf("N");
        }
    }
    printf("\n");
    
    return 0;
}