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;

using i64 = int64_t;

const i64 MOD = 1e9+7;

const i64 INF = 1e18+7;


signed main(){
    // B shibh308
    int n;
    cin >> n;
    vector<int> a(n);
    for(auto& x : a){
        char c;
        cin >> c;
        x = (c == 'T');
    }
    function<bool(bool,bool)> f = [&](bool x, bool y){
        return (!x) | y;
    };
    bool fl = a[0];
    for(int i = 1; i < n; ++i){
        fl = f(fl, a[i]);
    }
    cout << (fl ? "T" : "F") << endl;
}

