#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<int, int> vii;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

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

  int num[13] = {0};
  int a;
  rep(i,0,5) {
    cin >> a;
    num[a-1]++;
  }

  int pair=0, three=0;
  rep(i,0,13) {
    if(num[i] == 3) three++;
    else if(num[i] == 2) pair++;
  }

  if(three == 1 && pair == 1) cout << "FULL HOUSE" << endl;
  else if(three == 1 && pair == 0) cout << "THREE CARD" << endl;
  else if(pair == 2) cout << "TWO PAIR" << endl;
  else if(pair == 1) cout << "ONE PAIR" << endl;
  else cout << "NO HAND" << endl;

	return 0;
}