#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define fi first
#define se second
template<typename T> inline T min(vector<T>& v) {return *min_element(v.begin(), v.end());}
template<typename T> inline T max(vector<T>& v) {return *max_element(v.begin(), v.end());}
template<typename T> inline T sum(vector<T>& v) {return accumulate(v.begin(), v.end(), 0);}
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
string solve() {
	vi a(14); rep(i, 0, 5) {int t; cin >> t; ++a[t];}
	priority_queue<pii> pq;
	rep(i, 1, 14) if (a[i] != 0)
		pq.em(mp(a[i], i));
	vi ans;
	rep(i, 0, len(pq)) {
		ans.eb(pq.top().fi);
		pq.pop();
	}
	if (ans[0] == 3) {
		if (ans[1] == 2)
			return "FULL HOUSE";
		else
			return "THREE CARD";
	} else if (ans[0] == 2) {
		if (ans[1] == 2)
			return "TWO PAIR";
		else
			return "ONE PAIR";
	}
	return "NO HAND";
}
int main() {
	print(solve());
	return 0;
}