// Krzysztof Baranski (2021.12.08)
#include <cstdio>
#include <algorithm>
using namespace std;

int weights[500002];
int weights_sorted[500002];

int main() {
    int n;
    scanf("%d\n", &n);
    
    for(int i=0; i<n; ++i) {
        scanf("%d", weights+i);
        weights_sorted[i] = weights[i];
    }
    sort(weights_sorted, weights_sorted+n);
    int min_king_index = 0;
    long long sum_weights = 0;
    for(int i=0; i<n-1; ++i) {
        sum_weights += weights_sorted[i];
        if(sum_weights <= weights_sorted[i+1]) min_king_index = i;
    }
    int min_weight = weights_sorted[min_king_index];
    for(int i=0; i<n; ++i) {
        printf("%c", weights[i] > min_weight ? 'T' : 'N');
    }
    printf("\n");
    return 0;
}