#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#define X first
#define Y seconde
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  vector<int> cnt(14),a(5);
  rep(i,5)
    cin>>a[i];
  rep(i,5)
    cnt[a[i]]++;
  sort(all(a));
  if(a[0]==a[1] && a[3]==a[4] && ((a[2]==a[1]) !=  (a[2]==a[3]))){
    cout<<"FULL HOUSE"<<endl;
  }else if((*max_element(all(cnt)))==3){
    cout<<"THREE CARD"<<endl;
  }else if((*max_element(all(cnt)))==2){
    int t=0;
    rep(i,14)
      t+=(cnt[i]==2);
    cout<<(t==2?"TWO":"ONE")<<" PAIR"<<endl;
  }else{
    cout<<"NO HAND"<<endl;
  }
    
  return 0;
}