#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }


int main()
{
	while(true)
	{
		int v[5];
		char k;
		
		if(cin.eof()) break;
		cin >> v[0];
		rep(i, 4)
			cin >> k >> v[i+1];


		vint n(13, 0);

		rep(i, 5)
			n[v[i]-1]++;

		rep(i, 13)	if(4 == n[i])
		{
			cout << "four card" << endl;
			goto ng;
		}

		rep(i, 13) rep(j, 13) if(n[i] == 2 && n[j] == 3)
		{
			cout << "full house" << endl;
			goto ng;
		}

		rep(i, 10) if(n[i % 13] == 1 && n[(i+1) % 13] == 1 &&  n[(i+2) % 13] == 1 &&  n[(i+3) % 13] == 1 &&  n[(i+4) % 13] == 1)
		{
			cout << "straight" << endl;
			goto ng;
		}

		rep(i, 13) if(3 <= n[i])
		{
			cout << "three card" << endl;
			goto ng;
		}

		rep(i, 13) REP(j, i+1, 13) if(n[i] == 2 && n[j] == 2)
		{
			cout << "two pair" << endl;
			goto ng;
		}

		rep(i, 13) if(n[i] == 2)
		{
			cout << "one pair" << endl;
			goto ng;
		}

		cout << "null" << endl;

ng:
		;
	}
}