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;
#define int long long
const int MOD = 1000000007LL;
const int INF = LLONG_MAX;

char M(char x, char y){

    if(x == 'T' && y == 'F') return 'F';
    else return 'T';

}

signed main(){
    
    int n; cin >> n;
    vector<char> p(n);
    for(int i = 0; i < n; i++) cin >> p[i];

    char c = p[0];
    for(int i = 1; i < n; i++){
        c = M(c, p[i]);
    }

    cout << c << endl;

    return 0;
}
