#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <memory.h>
#include <cassert>

using namespace std;


#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define present(c, e) ((c).find((e)) != (c).end())
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)

#define mp make_pair
#define fst first
#define snd second
#define pb push_back


const double EPS = 1e-10;


typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;


int main() {
	char c;
	for (int a[5]; cin >> a[0]; ) {
		rep(i, 4) cin >> c >> a[i + 1];
		sort(a, a + 5);
		map<int, int> d;
		rep(i, 5) d[a[i]]++;
		int b[6];
		memset(b, 0, sizeof(b));
		tr(i, d) b[i->snd]++;
		if (b[4]) cout << "four card" << endl;
		else if (b[3] && b[2]) cout << "full house" << endl;
		else if (b[1] >= 4) {
			bool flg = true;
			rep(i, 4) if (a[i] + 1 != a[i + 1]) flg = false;
			if (flg) cout << "straight" << endl;
			else {
				flg = true;
				rep(i, 3) if (a[i + 1] + 1 != a[i + 2]) flg = false;
				if (flg && a[4] == 13 && a[0] == 1) cout << "straight" << endl;
				else cout << "null" << endl;
			}
		}
		else if (b[3]) cout << "three card" << endl;
		else if (b[2] == 2) cout << "two pair" << endl;
		else if (b[2] == 1) cout << "one pair" << endl;
		else cout << "null" << endl;
		
	}
	
	return 0;
}