#pragma target("avx") #include using namespace std; typedef long long ll; typedef long double ld; typedef pair P; typedef vector V; typedef unordered_map U_MAP; typedef priority_queue pq; typedef priority_queue, greater> rpq; const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10; const ll LINF = 1e18; #define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++) #define rrep(i, a, b) for (ll i = (a); i < (b); i++) #define rrrep(i, a, b) for (ll i = (a); i >= (b); i--) #define all(v) (v).begin(), (v).end() #define Size(n) (n).size() #define Cout(x) cout << (x) << endl #define doublecout(a) cout << fixed << setprecision(15) << a << endl; #define fi first #define se second #define m_p make_pair #define p_b push_back //------ Believe yourself as a genius!!!!!! ------ int dy[] = {1, 0, -1, 0}; int dx[] = {0, 1, 0, -1}; // int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1}; string alph("abcdefghijklmnopqrstuvwxyz"), s; ll n, cnt, ans, a[ohara], b, c, d, tmp, m, h, w, x, y, sum, k, q; int main(void) { cin.tie(0); cout.tie(0); ios::sync_with_stdio(false); cin >> n; rep(i, n) cin >> a[i]; rep(i, n - 1) { cnt = abs(a[i] - a[i + 1]); if (cnt == 1) continue; Cout("F"); return 0; } if (a[0] != 0) Cout("T"); else Cout("F"); return 0; }