#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

int a[5];
int num[14];
int solve() {
    map<int, int> m;

    rep (i, 5) m[a[i]]++;

    if (m.size() == 2) {
        if (m[a[0]] == 3 || m[a[0]] == 2) {
            return 0;
        }
    }

    for (auto p : m) {
        if (p.second == 3) return 1;
    }

    rep (i, 5) num[a[i]]++;

    int cnt = 0;

    rep (i, 14) {
        if (num[i] == 2) cnt++;
    }

    if (cnt == 2) return 2;
    else if (cnt == 1) return 3;

    return 4;
}

int main() {
    rep (i, 5) cin >> a[i];

    sort(a, a + 5);

    switch (solve()) {
        case 0: cout << "FULL HOUSE" << endl; break;
        case 1: cout << "THREE CARD" << endl; break;
        case 2: cout << "TWO PAIR" << endl; break;
        case 3: cout << "ONE PAIR" << endl; break;
        default: cout << "NO HAND" << endl; break;
    }
}