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 in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
int main()
{
	int n,i,a[4]={0,0,0,0},s=0;
	char a1;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%c",&a1);
		getchar();
		if(a1=='P')
		{
			a[0]=1;
		}
		else if(a1=='W')
		{
			a[1]=1;
		}
		else if(a1=='G')
		{
			a[2]=1;
		}
		else if(a1=='Y')
		{
			a[3]=1;
		} 
	}
	for(i=0;i<4;i++)
	{
		s+=a[i];
	}
	if(s==3)
	{
		printf("Three");
	}
	else
	{
		printf("Four");
	}
	return 0;
}