#include <iostream>
#include <algorithm>
#include <cstdio>
#include <math.h>
#include <iomanip>
#include <map>
#include <set>
#include <deque>
#include <vector>
#include <stack>
#include <queue>
// next_permutation(vv.begin(), vv.end())(辞書順で次になるやつだけ。)
// set yori sort & unique
// min_element
using namespace std;
#define ll long long
#define lli ll int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vs vector<string>
#define fr(i,k,N) for(int i=k;i<N;i++)
#define rep(i,N) for(int i=0;i<N;i++)
//template<class X>void low(X &t){for(auto it:t){t[0]=min(t[0],it);}return;}
//template<class X>void high(X &t){for(auto it:t){t[0]=max(t[0],it);}return;}
template<class X>void pr(X t){cout<<t<<endl;}
template<class X>void prr(X t){for(auto it:t){cout<<it;}cout<<endl;}
lli combination(int n,int r){lli t=1;r=min(r,n-r);fr(i,1, r+1)t=t*(n-r+i)/i;return t;}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int a,b,c,n,m,k;
    string s;
    char aaa;
    cin>>a>>b>>c>>n>>m;
    vector<int> aa;
    aa.push_back(a);
    aa.push_back(b);
    aa.push_back(c);
    aa.push_back(n);
    aa.push_back(m);
    sort(aa.begin(), aa.end());
    if ((count(aa.begin(), aa.end(), *aa.begin())==2&&
        count(aa.begin(), aa.end(), *(aa.begin()+2))==3)||
        (count(aa.begin(), aa.end(), *aa.begin())==3&&
        count(aa.begin(), aa.end(), *(aa.begin()+3))==2)
        ) {
        cout<<"FULL HOUSE"<<endl;
    }else if (count(aa.begin(), aa.end(), *(aa.begin()+1))==3||
              (count(aa.begin(), aa.end(), *(aa.begin()+2))==3)||
              (count(aa.begin(), aa.end(), *aa.begin())==3)
              ) {
        cout<<"THREE CARD"<<endl;
    }else if (count(aa.begin(), aa.end(), *(aa.begin()+1))==2&&
              (count(aa.begin(), aa.end(), *(aa.begin()+3))==2)
              ) {
        cout<<"TWO PAIR"<<endl;
    }else if (count(aa.begin(), aa.end(), *(aa.begin()+1))==2||
              (count(aa.begin(), aa.end(), *(aa.begin()+2))==2)||
              (count(aa.begin(), aa.end(), *(aa.begin()+3))==2)||
              (count(aa.begin(), aa.end(), *aa.begin())==2)
              ) {
        cout<<"ONE PAIR"<<endl;
    }else cout<<"NO HAND"<<endl;
    
    //    rep(i, a){
    //        cin>>k;
    //        v.push_back(k);
    //    }
    //    pr(combination(a,b));
    
    //do{ ...
    //        }while(next_permutation(v.begin(),v.end()));
    
    //high(v);
    //cout<<*v.begin;
    
    return 0;
}