import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.TreeSet;

public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		final int T = sc.nextInt();
		int x = 0;
		for(int i = 0; i < T; i++){
			final int nx = sc.nextInt();
			if(nx != x + 1 && nx != x - 1){ 
				System.out.println("F");
				return;
			}
			x = nx;
		}
		
		System.out.println("T");
	}
}