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>
#include <algorithm>

using namespace std;

int N;
string P;
string m1;

string f(string a, string b){
  if(a == "T" && b == "F"){
    return "F";
  }
  return "T";
}

int main(){
  cin >> N;
  cin >> m1;
  for(int i=0;i<N-1;i++){
    cin >> P;
    m1 = f(m1, P);
  }

  cout << m1 << endl;
  return 0;
}

