Problem: Create a program that reads poker hand data and outputs the role for each. However, this issue follows the rules below.

* Poker is a competition with 5 playing cards.
* No more than 5 cards with the same number.
* There is no joker.
* Suppose you only consider the following poker roles: (The higher the number, the higher the role.)


1. No role (does not apply to any of the following)
2. One pair (two cards with the same number)
3. Two pairs (two pairs of cards with the same number)
4. Three cards (one set of three cards with the same number)
5. Straight (the numbers on 5 cards are consecutive)
However, in the case of a straight containing A, the sequence ending with A is also straight. In other words, there are two types of straights containing A: A 2 3 4 5 and 10 J Q K A. Lines that straddle A, such as J Q K A 2, are not straight. (In this case, it will be "no role").
6. Full House (one set of three cards with the same number and the other two cards with the same number)
7. Four Cards (one set of four cards with the same number)



Input

The input consists of multiple datasets. Each dataset is given in the following format:


Hand 1, Hand 2, Hand 3, Hand 4, Hand 5


In your hand, Trump's J (jack) is 11, Q (queen) is 12, K (king) is 13, A (ace) is 1, and the others are represented by their respective numbers.

The number of datasets does not exceed 50.

Output

For each dataset, output one of the highest roles you can play in your hand. Follow the output example for the notation of the role.

Example

Input

1,2,3,4,1
2,3,2,3,12
12,13,11,12,12
7,6,7,6,7
3,3,2,3,3
6,7,8,9,10
11,12,10,1,13
11,12,13,1,2


Output

one pair
two pair
three card
full house
four card
straight
straight
null

Solution (in JAVA):

Solution:
import java.awt.CardLayout;
import java.awt.geom.Point2D;
import java.math.BigInteger;
import java.util.*;

public class Main {	
	public static void main(String[] args){
		new Main();
	}
	public Main(){
		new AOJ0038();
	}
	
	class AOJ0038{
		int [] cards;
		
		boolean four(){
			for(int i=0;i<14;i++)if(cards[i]>=4)return true;
			return false;
		}
		
		boolean full(){
			boolean two=false;
			boolean three=false;
			for(int s=0;s<14;s++){
				if(cards[s]==3)three=true;
				if(cards[s]==2)two=true;
			}
			return three&&two;
		}
		
		boolean straight(){
			if(cards[1]==1&&cards[13]==1&&cards[12]==1&&cards[11]==1&&cards[10]==1)return true;
			for(int i=5;i<14;i++){
				if(cards[i]==1&&cards[i-1]==1&&cards[i-2]==1&&cards[i-3]==1&&cards[i-4]==1)return true;
			}
			return false;
		}
		
		boolean three(){
			int three=0;
			for(int i=0;i<14;i++)if(cards[i]==3)three++;			
			if(three==1)return true;
			return false;
		}
		
		boolean two(){
			int two=0;
			for(int i=0;i<14;i++)if(cards[i]==2)two++;			
			if(two==2)return true;
			return false;
		}
		
		boolean one(){
			int two=0;
			for(int i=0;i<14;i++)if(cards[i]==2)two++;			
			if(two==1)return true;
			return false;
		}
		
		public AOJ0038() {
			Scanner in = new Scanner(System.in);
			while (in.hasNext()) {
				String[] input = in.nextLine().split(",");
				int[] huda = new int[input.length];
				for(int i=0;i<input.length;i++)huda[i]=Integer.parseInt(input[i]);
//				String[] yaku = {"one pair","two pair","three card","straight","full house","four card"};
				//TODO 最も高い役を出力する。
				Arrays.sort(huda);//小さい順にソート
				cards = new int[14];
				for(int i=0;i<huda.length;i++)cards[huda[i]]++;
				if(four())System.out.println("four card");
				else if(full())System.out.println("full house");
				else if(straight())System.out.println("straight");
				else if(three())System.out.println("three card");
				else if(two())System.out.println("two pair");
				else if(one())System.out.println("one pair");
				else System.out.println("null");
			}
			
			
		}
		
		
		
		
		
	}
	
	
	class AOJ2503{
		int MAX = 0;
		public AOJ2503() {
			Scanner in = new Scanner(System.in);
			int n = in.nextInt();
			int m = in.nextInt();

			int[][] cost = new int[n][n];

			int[] dp = new int[n];
			for(int i=0;i<n*n;i++){
				cost[i/n][i%n]=MAX;
			}
			for(int i=0;i<m;i++){
				int a = in.nextInt();
				int b = in.nextInt();
				cost[a][b]=in.nextInt();
			}	
			//			TODO 一番大きいパスを0のポイントからn-1のポイントまでの

			for(int s=1;s<n;s++){
				for(int i=0;i<=s;i++){
					if(cost[i][s]==MAX)continue;
					dp[s]=Math.max(dp[s],dp[i]+cost[i][s]);
				}
			}
			for(int s=0;s<n;s++)for(int i=0;i<n;i++){
				if(cost[s][i]==MAX)continue;
				dp[i]=Math.max(dp[s]+cost[s][i],dp[i]);
			}
			for(int i=0;i<n;i++)System.out.print(dp[i]+" ");
			System.out.println();
			System.out.println(dp[n-1]);
		}
	}



	class  AOJ0155{
		int d[];
		int n;
		int x[];
		int y[];
		int ban[];
		boolean sw;
		ArrayList<Integer> result;
		int back[];
		int[][] cost;
		void dijkstra(int s,int g){
			d = new int[n+1];d[s]=0;
			Arrays.fill(d,0);
			boolean used[] = new boolean[n+1];
			int sumn[] = new int[n+1];
			int v=s;
			int save = -1;
			back = new int[n+1];
			while(true){
				save = v;
				v=-1;
				for(int u=1;u<n+1;u++)if(!used[u]&&(v==-1||d[u]<d[v])){
					v=u;
				}
				System.out.println(v);
				if(v==-1)break;
				else back[v]=save;
				used[v]=true;
				for(int u=1;u<n+1;u++)if(cost[v][u]!=100000)d[u]=Math.min(1+d[v],d[u]);
			}
			for(int i=1;i<d.length;i++){
				System.out.println(i+" "+d[i]);
			}
			int now=g;
			result = new ArrayList<Integer>();
			int a=0;
			//			for(int i=0;i<back.length;i++){
			//				System.out.println(i+" "+back[i]);
			//			}
			while(true){
				if(cost[a][now]==1000000)sw = true;
				result.add(now);
				if(now==s)break;
				a = now;
				now=back[now];
			}
			return;
		}
		public AOJ0155(){
			Scanner in = new Scanner(System.in);
			while(true){
				n = in.nextInt();
				if(n==0)break;
				cost = new int[n+1][n+1];
				ban = new int[n+1];
				x = new int[n+1];
				y = new int[n+1];
				for(int i=1;i<n+1;i++){
					ban[i] = in.nextInt();
					x[ban[i]] = in.nextInt();
					y[ban[i]] = in.nextInt();
				}
				for(int i=1;i<n+1;i++){
					for(int s=i+1;s<n+1;s++){
						int x1 = x[i],y1= y[i],x2=x[s],y2=y[s];
						int costs = (int)Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));		
						cost[i][s] = costs > 50 ? 1000000:costs;
						cost[s][i] = cost[i][s];
					}
				}
				int kai = in.nextInt();
				for(int i=0;i<kai;i++){
					int s = in.nextInt();
					int g = in.nextInt();
					dijkstra(s, g);
//					if(sw){
//						System.out.println("NA");
//						break;
//					}
					for(int a=result.size()-1;a>=0;a--){
						System.out.print(result.get(a)+" ");
					}
					System.out.println();
				}
			}
		}
	}
}