from collections import defaultdict, Counter

from itertools import product, groupby, count, permutations, combinations

from math import pi, sqrt

from collections import deque

from bisect import bisect, bisect_left, bisect_right

from string import ascii_lowercase

from functools import lru_cache

INF = float("inf")

import sys

sys.setrecursionlimit(10000)





def solve(N, S):

    if "Y" in S:

        return "Four"

    else:

        return "Three"





def main():

    N = int(eval(input()))

    S = list(input().split())

    print((solve(N, S)))





if __name__ == '__main__':

    main()

#!/usr/bin/python3



from collections import defaultdict, Counter

from itertools import product, groupby, count, permutations, combinations

from math import pi, sqrt

from collections import deque

from bisect import bisect, bisect_left, bisect_right

from string import ascii_lowercase

from functools import lru_cache

import sys

sys.setrecursionlimit(10000)

INF = float("inf")

YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"

dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]





def inside(y, x, H, W):

    return 0 <= y < H and 0 <= x < W





def main():

    N = int(eval(input()))

    S = list(input().split())



    if "Y" in S:

        print("Four")

    else:

        print("Three")



if __name__ == '__main__':

    main()

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache

INF = float("inf")
import sys

sys.setrecursionlimit(10000)


def solve(N, S):
    if "Y" in S:
        return "Four"
    else:
        return "Three"


def main():
    N = int(eval(input()))
    S = list(input().split())
    print((solve(N, S)))


if __name__ == "__main__":
    main()

#!/usr/bin/python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys

sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def main():
    N = int(eval(input()))
    S = list(input().split())
    if "Y" in S:
        print("Four")
    else:
        print("Three")


if __name__ == "__main__":
    main()

+#!/usr/bin/python3 - -INF = float("inf") +INF = float("inf") +YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no" +dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0] -def solve(N, S): -    if "Y" in S: -        return "Four" -    else: -        return "Three" +def inside(y, x, H, W): +    return 0 <= y < H and 0 <= x < W -    print((solve(N, S))) +    if "Y" in S: +        print("Four") +    else: +        print("Three")