#include "bits/stdc++.h" using namespace std; using Graph = vector>; typedef long long ll; typedef pair P; #define rep(i,n) for (ll i = 0; i < (n); ++i) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const long long mod = 1e9 + 7; ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } int main() { ll t; cin >> t; ll now=0; vector v(t); rep(i, t) { cin >> v[i]; ll a = abs(now - v[i]); } rep(i, t) { ll a = abs(now - v[i]); if (a != 1) { cout << "F" << endl; return 0; } else { now = v[i]; } } cout << "T" << endl; }