#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;

int32_t main(){
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> tab(n);
    vector<pii> sorted(n);
    for(int i=0;i<n;i++) {
        cin >> tab[i];
        sorted[i] = {tab[i],i};
    }
    sort(sorted.begin(), sorted.end());


    auto solve = [&](int i) {
        long long siz = sorted[i].first;
        for(int j=0;j<n;j++) {
            if(j == i) continue;
            if(sorted[j].first >= siz) return 0;
            siz += sorted[j].first;
        }
        return 1;
    };

    int low = 0, high = n-1, mid,lg=-1;
    while(low <= high) {
        mid = (low+high)/2;
        if(solve(mid)) {
            high = mid-1;
            lg = mid;
        }
        else {
            low = mid+1;
        }
    }
    if(lg == -1)
        cout<<string(n,'N');
    else
        for(int i=0;i<n;i++)
            if(tab[i] >= sorted[lg].first)
                cout<<"T";
            else cout<<"N";
    
}