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>
#define int long long
using namespace std;

int N;
char p[100005];

signed main(){
  
  cin>>N;
  
  for(int i=0;i<N;i++) cin>>p[i];
  
  char pp = p[0];
  
  for(int i=1;i<N;i++){
    
    if( pp == 'T' && p[i] == 'T' ) pp = 'T';
    else if( pp == 'T' && p[i] == 'F' ) pp = 'F';
    else if( pp == 'F' && p[i] == 'T' ) pp = 'T';
    else if( pp == 'F' && p[i] == 'F' ) pp = 'T';
    
  }

  cout<<pp<<endl;
  
  return 0;
}

