#include<iostream>
#include<string>
#include<cstring>
#include<complex>
#include<vector>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<iomanip>
using namespace std;

#define REP(i, j) for (int i = 0; i < (int)j; ++i)
#define FOR(i, j, k) for (int i = (int)j; i < (int)k; ++i)
#define SORT(v) sort(v.begin(), v.end())
#define REVERSE(v) reverse(v.begin(), v.end())
typedef complex<double> P;
typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> PII;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int hand[5];
	REP (i,5) {
		int a;
		cin >> a;
		hand[i] = a;
	}
	
	VI cards(13,0);
	REP(i,5) {
		cards[hand[i]]++;
	}

	SORT(cards);

	if (cards[12] == 3 && cards[11] == 2) {
		cout << "FULL HOUSE" << endl;
	} else if (cards[12] == 3) {
		cout << "THREE CARD" << endl;
	} else if (cards[12] == 2 && cards[11] == 2) {
		cout << "TWO PAIR" << endl;
	} else if (cards[12] == 2) {
		cout << "ONE PAIR" << endl;
	} else {
		cout << "NO HAND" << endl;
	}

	return 0;
}