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<iostream>
using namespace std;

char TF( char a, char b )
{
    if( a == 'T' && b == 'F' )
        return 'F';
    else
        return 'T';
}

int main()
{
    int n;

    cin >> n;

    char c[n];
    cin >> c[0] >> c[1];
    
    char res = TF( c[0], c[1] );
    for( int i = 2; i < n; i++ )
    {
        cin >> c[i];
        res = TF( res, c[i] );
    }

    cout << res << endl;

    return 0;
}
