#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())




int main(){
	int c[15]={},p[15];
	int a,h;
	rep(i,5){
		cin>>a;
		++c[a-1];
	}
	rep(i,15)p[i]=c[i];
	sort(p,p+15,greater<int>());
	if(p[0]==3&&p[1]==2){
		cout<<"FULL HOUSE";
	}else if(p[0]==3){
		cout<<"THREE CARD";
	}else if(p[0]==2&&p[1]==2){
		cout<<"TWO PAIR";
	}else if(p[0]==2){
		cout<<"ONE PAIR";
	}else{
		cout<<"NO HAND";
	}cout<<endl;

	return 0;
}