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
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  int n;
  while (cin >> n) {
    deque<char> q;
    for (int i = 0; i < n; i++) {
      char c;
      cin >> c;
      q.push_back(c);
    }
    while (q.size() > 1) {
      char first = q[0]; q.pop_front();
      char second = q[0]; q.pop_front();
      char res;
      if (first == second) res = 'T';
      else res = 'T' + 'F' - first;
      q.push_front(res);
    }
    cout << q[0] << endl;
  }
  return 0;	
}
