problem

There is a mysterious device $ M $, and if you put Tanuki and Fox in this device, one animal will come out from the device (hereinafter, Tanuki will be $ T $ and Fox will be $ F $).

$ M (x, y) $ represents an animal that came out by putting animals in the device $ M $ in the order of $ x, y $.

As a result of various trials, the following was found.


$ M (T, T) = T $
$ M (T, F) = F $
$ M (F, T) = T $
$ M (F, F) = T $



You put the animals in a row $ P_1, P_2, ..., P_N $ into the device as follows.
$ M (.... M (M (P_1, P_2), P_3) ...., P_N) $

Answer the last animal that appears.



output

Output the last animal character $ T $ or $ F $, and also a newline at the end.

Example

Input

3
F T T


Output

T
#include <bits/stdc++.h>
using namespace std;

bool f(bool a, bool b) {
    if (a && !b) return false;
    return true;
}

int main() {
    int n;
    cin >> n;
    vector<bool> hoge(n);
    for (int i = 0; i < n; i++) {
        char c;
        cin >> c;
        hoge[i] = c == 'T';
    }

    bool ans = f(hoge[0], hoge[1]);
    for (int i = 2; i < n; i++) {
        ans = f(ans, hoge[i]);
    }

    cout << (ans ? "T" : "F") << endl;
}
