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<iostream>
using namespace std;
int main()
{
	int N,count=0,W=0,Y=0,P=0,G=0;
	cout<<"Enter the bags in arare"<<endl;
	cin>>N;
	char n[N];
	while(N<=1&&N>=100)
	cout<<"Enter the colors of bags"<<endl;
	for(int i=0;i<N;i++)
	{
		cin>>n[i];
	}
	for(int i=0;i<N;i++)
	{
		if(n[i]=='G')
		{
			G++;
			if(G>1)
			{
				G=1;
			}
			else
			{
				count++;
			}
		}
		if(n[i]=='W')
		{
			W++;
			if(W>1)
			{
				W=1;
			}
		    else
			{
				count++;
			}
		}
		if(n[i]=='P')
		{
			P++;
				if(P>1)
			{
				P=1;
			}
			else
			{
				count++;
			}
		}
		if(n[i]=='Y')
		{
			Y++;
				if(Y>1)
			{
				Y=1;
			}
			else
			{
				count++;
			}
		}
	}
	cout<<count<<endl;
	
	
}