#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <set>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
typedef pair<int,int> pii;

int main() {
	int p[5];
	char c;
	while(cin >> p[0] >> c >> p[1] >> c >> p[2] >> c >> p[3] >> c >> p[4]) {
		int n[13] = {};
		rep(i,5) n[p[i]-1]++;
		bool found = false;

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

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

		rep(i,10) {
			bool ok = true;
			rep(j,5) {
				if(n[(i+j)%13]!=1) {
					ok = false;
				}
			}
			if(ok) {
				cout << "straight" << endl;
				found = true;
			}
		}
		if(found) continue;

		rep(i,13) if(n[i]==3) {
			cout << "four card" << endl;
			found = true;
		}
		if(found) continue;

		int ps = 0;
		rep(i,13) if(n[i]==2) ps++;
		if(ps==2) {
			cout << "two pair" << endl;
		}
		else if(ps==1) {
			cout << "one pair" << endl;
		}
		else {
			cout << "null" << endl;
		}
	}
	return 0;
}