Problem:
 Score : 200 points    Problem Statement In Japan, people make offerings called hina arare , colorful crackers, on March 3 .  We have a bag that contains N hina arare. (From here, we call them arare.)  It is known that the bag either contains arare in three colors: pink, white and green, or contains arare in four colors: pink, white, green and yellow.  We have taken out the arare in the bag one by one, and the color of the i -th arare was S_i , where colors are represented as follows - pink: P , white: W , green: G , yellow: Y .  If the number of colors of the arare in the bag was three, print Three ; if the number of colors was four, print Four .      Constraints  1 \leq N \leq 100  S_i is P , W , G or Y .  There always exist i , j and k such that S_i= P , S_j= W and S_k= G .         Input Input is given from Standard Input in the following format:  N  S_1  S_2  ...  S_N       Output If the number of colors of the arare in the bag was three, print Three ; if the number of colors was four, print Four .        Sample Input 1 6
G W Y P Y W      Sample Output 1 Four  The bag contained arare in four colors, so you should print Four .       Sample Input 2 9
G W W G P W P G G      Sample Output 2 Three  The bag contained arare in three colors, so you should print Three .       Sample Input 3 8
P Y W G Y W Y Y      Sample Output 3 Four

Solution (Python):
N=int(input())
S=set(input().split())
if len(S)==3:
  print('Three')
else:
  print('Four')

Solution (Python):

import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left, bisect_right 
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')

N = int(input())
A = input().split()
ss = len(set(A))
if ss <= 3:
    print('Three')
else:
    print('Four')

Solution (Python):
n = int(input())
line = list(input().split())
print("Four") if len(set(line)) == 4 else print("Three")

Solution (Python):
N=int(input());print("Three" if len(set(input().split()))==3 else "Four")

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

n = k()
S = L()
a = list(Counter(S))
if len(a) == 3:
    print("Three")
else:
    print("Four")

Solution (Python):
n=int(input())
if "Y" in  list(input().split()):
  print("Four")
else:
  print("Three")

Solution (Python):
n = int(input())
s = list(map(str, input().split()))
a = list(set(s))
if len(a) == 3:
    print("Three")
else:
    print("Four")

Solution (Python):
N = int(input())
S = set(list(input().split()))
if len(S) is 3: print('Three')
else: print('Four')

Solution (Python):


N = int(input())
S = list(map(str, input().split()))

set_S = set(S)

if len(set_S) == 3:
    print('Three')
else:
    print('Four')

Solution (Python):
N = int(input())
S = set(list(input().split()))

if len(S)==3:
  print("Three")
else:
  print("Four")

Solution (Python):
import sys
from math import ceil
def input(): return sys.stdin.readline().strip()


def main():
    n = int(input())
    S = list(input().split())
    yellow = False
    for c in S:
        if c == 'Y':
            yellow = True
            break
    if yellow: print("Four")
    else: print('Three')

if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
S = list(map(str, input().split()))

if "Y" in S:
    print("Four")
else:
    print("Three")

Solution (Python):
n = int(input())
s = list(input().split())
cnt = 0
for c in ("P", "W", "G", "Y"):
    if s.count(c):
        cnt += 1
ans = "Three" if cnt == 3 else "Four"
print(ans)

Solution (Python):
n=int(input())
ss=list(map(str,input().split()))
print('Three'if len(set(ss))==3else'Four')

Solution (Python):
N = int(input())
s = list(map(str,input().split()))

if s.count("Y") >0:
    print("Four")
else:
    print("Three")

Solution (Python):
n=int(input())
s=list(input().split())
if len(set(s))==4:
    print("Four")
else:
    print("Three")

Solution (Python):
n = int(input())
s = list(input().split())
arare = len(set(s))

if arare == 4:
    print('Four')
else:
    print('Three')

Solution (Python):
n=int(input())

sl=list(map(str,input().split()))


if 'Y' in sl:
    print("Four")
else:
    print("Three")

Solution (Python):
n=int(input())
s=list(map(str, input().split()))
print("Four" if "Y" in s else "Three")

Solution (Python):
n = int(input())
s = input().split()
ss = list(set(s))
print('Four' if len(ss)==4 else 'Three')

Solution (Python):
n = int(input())
s = list(input().split())

if 'Y' in s:
  print('Four')
else:
  print('Three')

Solution (Python):
N=int(input())
S=list(input().split())
 
if 'Y' in S:
  print('Four')
else:
  print('Three')

Solution (Python):
n,s=map(str,open(0));print("Four" if "Y" in s else "Three")

Solution (Python):
N=int(input())
S=list(input().split())
X=set()
for s in S:
  X.add(s)
  
if len(X)==3:
  print('Three')
else:
  print('Four')

Solution (Python):
n = int(input())
s = list(map(str,input().split()))
arare = [0,0,0,0]

for i in range(n):
  if s[i] == "P":
    arare[0] = "1"
  elif s[i] == "W":
    arare[1] = "1"
  elif s[i]== "G":
    arare[2] = "1"
  else:
    arare[3] = "1"
    
  if arare.count("1") == 4:
    print("Four")
    exit()
    
print("Three")

Solution (Python):
import math
def main():
  n = int(input())
  s = list(map(str,input().split()))
  if 'Y' in s:
    print('Four')
  else:
    print('Three')
main()

Solution (Python):
N = int(input())
S = input().split()

if len(set(S)) == 3:
    print("Three")
else:
    print("Four")

Solution (Python):
import sys
N = int(input())
S = list(input().split())
if not ( 1 <= N <= 100 ):
    sys.exit()
for I in range(len(S)):
    if not (S[I] == 'P' or 'W' or 'G' or 'Y'):
        sys.exit()

result = set(S)
if len(result) == 3:
    print('Three')
else:
    print('Four')

Solution (Python):

N = int(input())
S = set(map(str, input().split()))


if len(S) == 3:
    print("Three")
else:
    print("Four")

Solution (Python):
_ = input()
*S, = input().split()
l = len(set(S))
if l == 4:
    print("Four")
else:
    print("Three")

Solution (Python):
def actual(N, S):
    number_of_hina_arare_types = len(set(S))

    color_map = {3: 'Three',
                 4: 'Four'}

    return color_map[number_of_hina_arare_types]

N = int(input())
S = input().split()

print(actual(N, S))

Solution (Python):
_ = input()
print('Four' if len(set(input().split())) == 4 else 'Three')

Solution (Python):
n=int(input())
l=list(input().split())
if "Y" in l:
    print("Four")
else:
    print("Three")

Solution (Python):
a=int(input())
b=list(map(str,input().split()))
n=len(set(b))

if n==3:
  print('Three')
else:
  print('Four')

Solution (Python):
n = int(input())
lis = input().split()

if len(set(lis)) == 3:
    print("Three")
else:
    print("Four")

Solution (Python):
n=int(input())
s=list(input().split())
print("Four" if "Y" in s else "Three")

Solution (Python):
N=int(input());print('Three' if len(set(input().split()))==3 else 'Four')

Solution (Python):
N = input()
print("Four" if "Y" in input() else "Three")

Solution (Python):
n = int(input())
lst = input().split()
print('Four' if 'Y' in lst else 'Three')

Solution (Python):
import sys

N = int(input())
S = input()

for s in S:
    if s == 'Y':
        print('Four')
        sys.exit()
print('Three')

Solution (Python):
int(input())
s=len(list(set(list(input().split()))))
print("Three" if s==3 else "Four")

Solution (Python):
n=int(input())
s=input()
if "Y" in s:
  print("Four")
else:
  print("Three")

Solution (Python):
n=input()
lst=[i for i in input().split()]
if "Y" in lst:
    print("Four")
else:
    print("Three")

Solution (Python):
input()
s = input().split()
if 'Y' in s:
    print('Four')
else:
    print('Three')

Solution (Python):
input()
print('Four' if 'Y' in input() else 'Three')

Solution (Python):
N = int(input())

if "Y" in input():
  print("Four")
else:
  print("Three")

Solution (Python):
n = int(input())

al = list(input().split())

for i in range(n):
    if al[i] =="Y":
        print("Four")
        exit()

print("Three")

Solution (Python):
n = int(input())
l = list(input().split())
if len(set(l)) == 4:
    print('Four')
else:
    print('Three')

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

s = [0]*4
N = i()
S = L()
for i in range(N):
    if S[i] == 'P':
        s[0] = 1
    if S[i] == 'W':
        s[1] = 1
    if S[i] == 'G':
        s[2] = 1
    if S[i] == 'Y':
        s[3] = 1
if sum(s) == 3:
    print('Three')
else:
    print('Four')

Solution (Python):
n = int(input())
s = list(input().split())
print('Four') if 'Y' in s else print('Three')

Solution (Python):
N = int(input())
S = set(list(input().split()))
if len(S) == 3:
    print("Three")
else:
    print("Four")

Solution (Python):
n = int(input())
s = list(input().split())

num = 0
l = []

for i in s:
  if i not in l:
    num += 1
  l.append(i)
if num == 3:
    print('Three')
else:
    print('Four')

Solution (Python):
n=int(input())
s=input().split()

b=1
for i in s:
    if i=='Y':
       b=0

if b==0:
    print('Four')
else:
    print('Three')

Solution (Python):
N = int(input())
S = input().split()

if 'Y' in S:
	print('Four')
else:
	print('Three')

Solution (Python):
import sys
input = sys.stdin.readline

N = int(input())
A = list(map(str, input().rstrip().split()))

print("Four" if len(set(A))==4 else  "Three")

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    N = int(input())
    S = map(str, input().strip("\n"))
    if "Y" in S: print("Four")
    else: print("Three")

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
N=int(input())
S=list(map(str,input().split()))
p=[]
for i in range(N):
  if not S[i] in p:
    p.append(S[i])
if len(p)==3:
  print('Three')
else:
  print('Four')

Solution (Python):
N = int(input())
S = list(map(str,input().split()))
if 'Y' in S:
	print('Four')
else:
	print('Three')

Solution (Python):
N = int(input())
S = list(input().split())
ans = len(set(S))
if ans <=3:
    print('Three')
else:
    print('Four')

Solution (Python):
n = input()
s = list(input().split())
if "Y" in s:
  print("Four")
else:
  print("Three")

Solution (Python):
N=int(input())
S=list(input().split())
for s in S:
  if s=='Y':
    print('Four')
    exit(0)
print('Three')

Solution (Python):
N = int(input())
S = set(list(input().split()))
if len(S) == 3:
    print('Three')
else:
    print('Four')

Solution (Python):
n=int(input())
s=list(input().split())
color=[0]*4
for i in s:
    if i=="P":
        color[0]+=1
    elif i=="W":
        color[1]+=1
    elif i=="G":
        color[2]+=1
    else:
        color[3]+=1
print("Four" if color.count(0)==0 else "Three")

Solution (Python):
N = int(input())
S = set(input().split())

if len(S) == 3:
    print('Three')
elif len(S) == 4:
    print('Four')

Solution (Python):
n=int(input())
lis=list(input().split())
ans=0
for i in range(n):
  if lis[i] == "Y":
    ans=1
print(["Three","Four"][ans])

Solution (Python):
n = int(input())
s = list(map(str,input().split()))
if "Y" in s:
    print("Four")
else:
    print("Three")

Solution (Python):
N = input()
color_list = [i for i in input().split()]
print('Four') if 'Y' in color_list else print('Three')

Solution (Python):
n = input()
seta = set(list(input().split()))
print("Four") if len(seta) == 4 else print("Three")

Solution (Python):
from collections import Counter
N = input()
color_list = [i for i in input().split()]
result = len(Counter(color_list))

if result == 3:
    result = 'Three'
elif result == 4:
    result = 'Four'

print(result)

Solution (Python):
def mi():
    return map(int, input().split())

def ii():
    return int(input())

def main():
    N = ii()
    S = set(input().split())
    if len(S) == 3:
        print('Three')
    else:
        print('Four')


if __name__ == '__main__':
    main()

Solution (Python):
N = input()
S = list(map(str,input().split()))
if "P" in S and "W" in S and "G" in S and "Y" in S :
    print("Four")
else :
    print("Three")

Solution (Python):
n = int(input())
s = list(input().split())
s = set(s)
if len(s) == 3:
    print('Three')
else:
    print('Four')

Solution (Python):
N=int(input())
S=list(input().split())
print("Four" if "Y" in S else "Three")

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    N = int(input())
    S = input().split()

    ans = "Four" if "Y" in S else "Three"

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
input()
A=map(str,input().split())
if len(set(A))==4:
  print("Four")
else:
  print("Three")

Solution (Python):
N = int(input())
S = list(input().split())
if len(set(S)) == 3:
    print("Three")
else:
    print("Four")

Solution (Python):
N = int(input())
S = list(map(str,input().split()))

S = list(set(S))

if len(S) == 3:
  ans = 'Three'
else:
  ans = 'Four'

print(ans)

Solution (Python):
N = int(input())
arare = input().split()
y = 0
for i in range(len(arare)):
  if arare[i] == "Y":
    y += 1
    break
if y == 1:
  print("Four")
else:
  print("Three")

Solution (Python):
n = int(input())
s = list(map(str,input().split()))
for i in s:
	if i == 'Y':
		print("Four")
		exit()
print("Three")

Solution (Python):
n=int(input())
s=input().split()

x=set(s)
if len(x)==3:
    print('Three')
else:
    print('Four')

Solution (Python):
input()
s = input().split()
print('Four' if len(set(s)) == 4 else 'Three')

Solution (Python):
N = int(input())
S = input().split()

if 'Y' in S:
    print('Four')
else:
    print('Three')

Solution (Python):
N = int(input())
S = set(list(input().split()))

print('Three' if len(S) == 3 else 'Four')

Solution (Python):
input()
S = set(input().split())
print('Three' if len(S) == 3 else 'Four')

Solution (Python):
N=input();print(['Three','Four']['Y'in input().split()])

Solution (Python):
_=int(input());print(['Three','Four']['Y'in input().split()])

Solution (Python):
N=int(input());print(['Three','Four']['Y'in input().split()])

Solution (Python):
N = int(input())
S = [i for i in input().split() if i=='Y']
print('Four' if S else 'Three')

Solution (Python):
N = int(input())
S = [True if i=='Y' else False for i in input().split()]
print('Four' if any(S) else 'Three')

Solution (Python):
n = int(input())
s = input()
if "Y" in s:
    print("Four")
else:
    print("Three")

Solution (Python):
n = int(input())
apple = list(map(str, input().split()))
print("Four" if "Y" in apple else "Three")

Solution (Python):
n = int(input())
S = list(input().split())

L = []
for i in range(len(S)):
  if S[i] not in L:
    L.append(S[i])
if len(L) == 3:
  print("Three")
else:
  print("Four")

Solution (Python):
n = int(input())
s_list = input().split()
print("Four" if "Y" in s_list else "Three")

Solution (Python):
N = int(input())
S = set(input().split())
if len(S) == 3:
    print('Three')
elif len(S) == 4:
    print('Four')

Solution (Python):
n = int(input())
S = set(input().split())

if len(S) == 3:
    print('Three')
elif len(S) == 4:
    print('Four')

Solution (Python):
def resolve():
    N = int(input())
    hina = list(input().split())
    print("Three" if len(set(hina)) == 3 else "Four")
resolve()

Solution (Python):
N = int(input())
arr = list(map(str, input().strip().split()))

if len(set(arr)) == 4:
  print("Four")
elif len(set(arr)) == 3:
  print("Three")

Solution (Python):
n=int(input())
a=list(input().split())
b=set(a)
if len(b)==3:
  print('Three')
if len(b)==4:
  print('Four')

Solution (Python):
N = int(input())
if 'Y' in input().split():
  print('Four')
else:
  print('Three')

Solution (Python):
def main():
    n = int(input())
    s = list(input().split())
    res = len(set(s))
    if res == 4:
        print('Four')
    else:
        print('Three')

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
s = list(map(str, input().split()))
from collections import Counter
d = Counter(s)
if len(d) == 3:
    print('Three')
else:
    print('Four')

Solution (Python):
_=input();s=input().split();print("TFhoruere"["Y"in s::2])

Solution (Python):
n=int(input())
s=input().split()

a=s.count("Y")
if a:
  print("Four")
else:
  print("Three")

Solution (Python):
n = int(input())
s = list(input().split())
print('Four' if s.count('Y') >= 1 else 'Three')

Solution (Python):
n = int(input())
arr = list(map(str, input().split()))
arr = list(set(arr))
if len(arr) == 3:
  print('Three')
elif len(arr) == 4:
  print('Four')

Solution (Python):
n = int(input())
s = input().split()
if "Y" in s:
    print("Four")
else:
    print("Three")

Solution (Python):
N = int(input())
S = list(input().split())
flag = 0
for i in range(N):
  if S[i] == "Y":
    flag += 1
if flag > 0:
  print("Four")
else:
  print("Three")

Solution (Python):
n=int(input())
l=list(map(str,input().split()))

for i in range (n):
  if l[i]=='Y':
    print('Four')
    exit()
print('Three')

Solution (Python):
def ABC_89_B():
    N=int(input())
    s = input().split()
    l = ['P','W','G','Y']
    c=0
    for i in range(len(l)):
        if s.count(l[i])>=1:
            c+=1

    if c==3:
        print('Three')
    else:
        print('Four')

if __name__ == '__main__':

    ABC_89_B()

Solution (Python):
colors = {}
n = int(input())
s = [i for i in input().split()]
for color in s:
    colors[color] = 1
if len(colors) == 3:
    print('Three')
else:
    print('Four')

Solution (Python):
import collections
def solve(n, s_list):

    counter = collections.Counter()
    for s in s_list:
        counter[s[0]] += 1


    if len(counter.keys()) == 4:
        return "Four"
    else:
        return "Three"


if __name__ == "__main__":
    n = int(input())
    s_list = [i for i in input().split()]
    print(solve(n, s_list))

Solution (Python):
n = int(input())
s = list(map(str,input().split()))
for i in range(n):
    if s[i] == "Y":
        print("Four")
        break
else:
    print("Three")

Solution (Python):
n = int(input())
s = input().split()
if "Y" in s:
  print("Four")
else:
  print("Three")

Solution (Python):
N = int(input())

Sn = input().split()

for c in Sn:
    if c == 'Y':
        num = 1
        break
    num = 0

if num == 1:
    result = 'Four'
else:
    result = 'Three'

print(result)

Solution (Python):
input()
print(["Three","Four"]["Y" in input()])

Solution (Python):
n=int(input())

a=input().split()

if 'Y' in a:
    print('Four')

else:
    print('Three')

Solution (Python):
N = int(input())
S = list(input().split())
if 'Y' in S:
    print("Four")
else:
    print("Three")

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n = ii()
    L = input().split()
    print('Four') if 'Y' in L else print('Three')


if __name__ == "__main__":
    main()

Solution (Python):
n = input()
l = list(map(str,input().split()))
print("Four" if len(set(l)) == 4 else "Three")

Solution (Python):
n=int(input())
S=list(input().split())
print('Three' if len(set(S))==3 else 'Four')

Solution (Python):
N = input()
s = set(input().split())
if len(s) == 3:
  print('Three')
else:
  print('Four')

Solution (Python):
n=int(input())
s=list(map(str,input().split()))

if s.count('Y')>0:
    print('Four')
else:
    print('Three')

Solution (Python):
from collections import Counter
n = int(input())
S = Counter(input().split())
print('Four' if len(S) == 4 else 'Three')

Solution (Python):
N = int(input())
S = list(map(str,input().split()))
if len(set(S)) == 4:
    print('Four')
elif len(set(S)) == 3:
    print('Three')

Solution (Python):
input()
print("Four" if "Y" in input() else "Three")

Solution (Python):
n = int(input())
s = set(input().split())
if len(s)==3:
    print('Three')
else :
    print('Four')

Solution (Python):
n = int(input())
s = set(map(str, input().split()))

print("Three" if len(s) == 3 else "Four")

Solution (Python):
n=input()
a=[i for i in input().split()]
if "Y" in a:
    print("Four")
else:
    print("Three")

Solution (Python):
n = int(input())
s = list(map(str, input().split()))

s = len(list(set(s)))

if s == 3:
    print("Three")
else:
    print("Four")

Solution (Python):
n=int(input())
s=list(map(str,input().split()))
if len(set(s))==4:
    print('Four')
else:
    print('Three')

Solution (Python):
n = int(input())
s = input().split()

s = list(set(s))

if len(s) == 4:
    print('Four')
else:
    print('Three')

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def Yes(): print("Yes"); return
def No(): print("No"); return


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr


def make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def lcm(a, b):
    return a * b // gcd (a, b)


def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count


def Base_10_to_n(X, n):
  if X//n:
    return Base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def Base_n_to_10(X, n):
  return sum(int(str(X)[-i])*n**i for i in range(len(str(X))))


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count





N = inputI()
s = len(set(inputSL()))

if s == 3:
  print("Three")
else:
  print("Four")

Solution (Python):
n = int(input())
s = {i for i in input().split()}
print('Three' if len(s) == 3 else 'Four')

Solution (Python):
n = int(input())

l = len(set(list(map(str, input().split()))))

if l == 1:
    print("One")
elif l == 2:
    print("Two")
elif l == 3:
    print("Three")
else:
    print('Four')

Solution (Python):
n = int(input())
s = [str(i) for i in input().split()]
a = set(s)
if len(a) == 3:
	print('Three')
else:
	print('Four')

Solution (Python):
n=int(input())
s=list(input().split())
if s.count("Y")==0:
    print("Three")
else:
    print("Four")

Solution (Python):
n = int(input())
S = list(input())
if 'Y' in S:
    print('Four')
else:
    print('Three')

Solution (Python):
import sys
input = sys.stdin.readline

N = int(input().rstrip())
array = input().rstrip().split()

if 'Y' not in array:
  print('Three')
else:
  print('Four')

Solution (Python):
n=int(input())
s=list(map(str,input().split()))

s_1=set(s)
if len(s_1)==4:
    print("Four")
else:
    print("Three")

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
from decimal import *

import numpy


if __name__ == '__main__':
    an = int(input())
    a = [i for i in input().split()]
    ans = len(set(a))

    if ans == 4:
        print("Four")
    else:
        print("Three")

Solution (Python):

n = int(input())
s = list(input().split())
s_set = set(s)
print("Four" if len(s_set) == 4 else "Three")

Solution (Python):
n = int(input())
s = input().split()

s_t = set(s)
if len(s_t) == 3:
    print('Three')
elif len(s_t) == 4:
    print('Four')

Solution (Python):
n=int(input())
a=list(input().split())
print('Four' if 'Y' in a else 'Three')

Solution (Python):
n = int(input())
s = set(input().split())
l = len(s)
if l==4:
    print("Four")
elif l==3:
    print("Three")

Solution (Python):
_ = input()
A = list(input().split())
if 'Y' in A:
  print('Four')
else:
  print('Three')

Solution (Python):

"""
Created on Fri May 15 13:53:37 2020

@author: shinba
"""

n = int(input())

print("Three" if len(set(map(str,input().split()))) == 3 else "Four")

Solution (Python):
import sys
import math
import bisect

def solve(A):
    if len(set(A)) == 3:
        return 'Three'
    else:
        return 'Four'

def main():
    n = int(input())
    A = input().split()
    print(solve(A))

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
a = list(map(str, input().split()))
if a.count('Y') == 0:
  print('Three')
else:
  print('Four')

Solution (Python):
n = int(input())
s = input()
if s.count('Y') >= 1:
  print('Four')
else:
  print('Three')

Solution (Python):
n = int(input())
if len(set(input().split())) == 3:
    print('Three')
else:
    print('Four')

Solution (Python):
_ = int(input())
S = set(input().split())
print('Three' if len(S) == 3 else 'Four')

Solution (Python):
n = int(input())
s = list(map(str, input().split()))
import collections
s = collections.Counter(s)

if len(s)==4:
    print('Four')
else:
    print('Three')

Solution (Python):
n = int(input())
s = list(input().split())

l = []
for i in s:
  if i not in l:
    l.append(i)
if len(l) == 3:
  print('Three') 
else:
  print('Four')

Solution (Python):
a=int(input())
b=list(map(str,input().split()))
if len(set(b))==3:
    print('Three')
else:
    print('Four')

Solution (Python):
n=str(input())
s=list(map(str,input().split()))
s=set(s)
if len(s)==4:
  print("Four")
elif len(s)==3:
  print("Three")
elif len(s)==2:
  print("Two")
else:
  print("One")

Solution (Python):
def main():
    n = int(input())
    S = input().split()

    if 'Y' in S:
        print('Four')
    else:
        print('Three')


if __name__ == '__main__':
    main()

Solution (Python):
def main():
    n = int(input())
    S = input()

    if 'Y' in S:
        print('Four')
    else:
        print('Three')


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
S = input().split()
if len(set(S)) == 3:
  print("Three")
else:
  print("Four")

Solution (Python):
n=int(input())
s=list(map(str,input().split()))
if "Y" in s:
    print("Four")
else:
    print("Three")

Solution (Python):
from collections import Counter

def resolve():
	n = int(input())
	s = input().split()
	c = Counter(s)
	if len(c.keys()) == 3:
		print('Three')
	else:
		print('Four')
resolve()

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    N=int(input())
    S=set(list(input().split()))
    if len(S)==3:
        print('Three')
    else:
        print('Four')

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
s = input().split()

if len(set(s)) == 3: print("Three")
else: print("Four")

Solution (Python):
n = int(input())
s = list(input().split())
cnt = 0

for i in range(n):
    if s[i] == 'Y':
        cnt += 1

if cnt == 0:
    print('Three')
else:
    print('Four')

Solution (Python):
_ = input()
S = set(input().split())
print('Three' if len(S) == 3 else 'Four')

Solution (Python):
N = int(input())
S = map(str, input().split())
if len(set(S)) == 3:
    print("Three")
else:
    print("Four")

Solution (Python):
n = int(input())
s = list(input().split())

ans = len(set(s))
print('Three') if ans == 3 else print('Four')

Solution (Python):
n = int(input())
s = list(map(str, input().split()))
f = [False] * 4
for i in range(n):
    if s[i] == 'P':
        f[0] = True

    elif s[i] == 'W':
        f[1] = True
    
    elif s[i] == 'G':
        f[2] = True
    
    else:
        f[3] = True

if sum(f) == 3:
    print('Three')

elif sum(f) == 4:
    print('Four')

Solution (Python):
N = int(input())
S = list(input().split())

print("Three" if len(set(S)) == 3 else "Four")

Solution (Python):
n = int(input())
le = len(set(input().split()))
if le == 3:
    print('Three')
else:
    print('Four')

Solution (Python):
N = int(input())
S = input().split()

if "Y" in S:
  print("Four")
else:
  print("Three")

Solution (Python):
N = int(input())
S = [i for i in input().split()]
if "Y" in S:
    print("Four")
else:
    print("Three")

Solution (Python):
n = int(input())
s_list = list(input().split())
if 'Y' in s_list:
  print('Four')
else:
  print('Three')

Solution (Python):
n = int(input())
hashSet = set(input().split())
if 'Y' in hashSet:
  print('Four')
else:
  print('Three')

Solution (Python):
n = int(input())
s = list(input().split())
hina = set(s)
arare = len(hina)
if arare == 3:
    print("Three")
else:
    print("Four")

Solution (Python):
n = int(input())
hina_set = set((input().split()))

if len(hina_set) == 3:
    print("Three")
else:
    print("Four")