#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#define N 1000
#define re(i,n) for(int i=0;i<(n);i++)
using namespace std;

typedef long long ll;

bool x(pair<int,int> a,pair<int,int> b){
	return a.second<b.second;
}

int main(void){
	int a[5];
	std::map<int,int> m;
	re(i,5)cin>>a[i],m[a[i]]++;
	if(m.size()==2)cout<<"FULL HOUSE"<<endl;
	else if(m.size()==3&&(max_element(m.begin(),m.end(),x)->second)==3)cout<<"THREE CARD"<<endl;
	else if(m.size()==3)cout<<"TWO PAIR"<<endl;
	else if(m.size()==4)cout<<"ONE PAIR"<<endl;
	else cout<<"NO HAND"<<endl;
	return 0;
}