#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

vector<int> cards;
int main() {


	for(int i=0; i<5; i ++){
		int tmp;
		cin>>tmp;
		cards.push_back(tmp);
	}
	sort(cards.begin(),cards.end());

	if(cards[0] == cards[1] && cards[1] == cards[2] && cards[2] == cards[3] && cards[3] == cards[4]){
		cout<<"NO HAND"<<endl;
		return 0;
	}

	if((cards[0] == cards[1] && cards[1] == cards[2] && cards[3] == cards[4]) || (cards[2] == cards[3] && cards[3] == cards[4] && cards[0] == cards[1])){
		cout<<"FULL HOUSE"<<endl;
		return 0;
	}else if(cards[0] == cards[1] && cards[1] == cards[2] && cards[2] != cards[3]|| cards[1] == cards[2] && cards[2] == cards[3] && cards[0] != cards[1]&& cards[3] != cards[4]|| cards[2] == cards[3] && cards[3] == cards[4] && cards[1] != cards[2]){
		cout<<"THREE CARD"<<endl;
		return 0;
	}else if (cards[0] == cards[1] && cards[2] == cards[3] && cards[1] != cards[2] ||cards[0] == cards[1] && cards[3] == cards[4] && cards[1] != cards[3] || cards[1] == cards[2] && cards[3] == cards[4]&& cards[2] != cards[3]){
		cout<<"TWO PAIR"<<endl;
		return 0;
	}else if (cards[0] == cards[1]  && cards[1] != cards[2]|| cards[1] == cards[2] && cards[2] != cards[3] && cards[0] != cards[1]||  cards[2] == cards[3] && cards[1] != cards[2] && cards[3] != cards[4]|| cards[3] == cards[4]&& cards[2] != cards[3]) {
		cout<<"ONE PAIR"<<endl;
		return 0;
	}else {
		cout<<"NO HAND"<<endl;
	}



	return 0;
}