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;
/*
int main(){
  int n;
  scanf("%d",&n);
  char a,b;
  scanf("%c",&a);
  for(int i=0;i<n-1;i++){
    scanf("%c",&b);
     printf("%c\n",b);
    if(a == 'T' && b == 'F')a = 'F';
    else a = 'T';
    printf("%c\n",b);
  }
  printf("\n%c\n",a);
  return 0;
  */
int main(){
  int n;
  char a,b;
  scanf("%d\n",&n);
  scanf("%c",&a);
  for(int i=0;i<n-1;i++){
    scanf(" %c",&b);
    //  printf("%d %c\n",i,b);
    if(a == 'T' && b == 'F'){
      a = 'F';
    }else{
      a = 'T';
    }
  }
  printf("%c\n",a);
  return 0;
}

