#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

bool compareSums(const pair<int, unsigned long long>& a, const pair<int, unsigned long long>& b)
{
    return a.second < b.second;
}

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

    int numberOfCatfishes;
    cin >> numberOfCatfishes;

    vector<pair<int, unsigned long long>> catfish(numberOfCatfishes);
    unsigned long long weight;

    for (int i = 0; i < numberOfCatfishes; i++) {
        cin >> weight;
        catfish[i] = make_pair(i, weight);
    }

    sort(catfish.begin(), catfish.end(), compareSums);

    vector<unsigned long long> catfishWeightSum(numberOfCatfishes);
    unsigned long long currentSum = 0;

    for (int i = 0; i < numberOfCatfishes; i++) {
        currentSum += catfish[i].second;
        catfishWeightSum[i] = currentSum;
    }

    unsigned long long currentSumToSet = catfishWeightSum[numberOfCatfishes - 1];

    for (int i = numberOfCatfishes - 2; i >= 0; i--) {
        if (catfish[i].second == catfish[i + 1].second) {
            catfishWeightSum[i] = catfishWeightSum[i + 1];
        }
        if (catfish[i].second == catfish[0].second) {
            catfishWeightSum[i] = catfishWeightSum[0];
        }
    }

    vector<bool> canBecomeCatfishKing(numberOfCatfishes, false);
    canBecomeCatfishKing[catfish[numberOfCatfishes - 1].first] = true;

    if (catfish[0].second == catfish[numberOfCatfishes - 1].second) {
        for (int i = 0; i < numberOfCatfishes; i++) {
            cout << "N";
        }
        return 0;
    }

    for (int i = numberOfCatfishes - 2; i >= 0; i--) {
        if (catfishWeightSum[i] > catfish[i + 1].second) {
            canBecomeCatfishKing[catfish[i].first] = true;
        }
        else {
            break;
        }
    }

    for (int i = 0; i < numberOfCatfishes; i++) {
        if (canBecomeCatfishKing[i]) {
            cout << "T";
        }
        else {
            cout << "N";
        }
    }
}