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.util.HashSet;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.TreeSet;



 class Main{
     public static void main(String args[]){
         Scanner sc = new Scanner(System.in);
         String line;
         while(sc.hasNext()){
             line=sc.nextLine();
             if(line.isEmpty())break;
             String[] split=line.split(",");
             int[] ints = new int[5]; for(int i=0;i<5;i++)ints[i]=Integer.parseInt(split[i]);
             if(!_4c(ints)){//System.out.println("aa");
                 if(!fullH(ints)){//System.out.println("bb");
                     if(!st(ints)){//System.out.println("cc");
                         if(!_3c(ints)){//System.out.println("dd");
                             if(!_2p(ints)){//System.out.println("dd");
                                 //System.out.println(_1p(ints));
                                 if(!_1p(ints)){//System.out.println("ee");
                 System.out.println("null");}}}}}}
         }
         
         
     }
     static boolean _4c(int[] ints){
         if(ints[1]==ints[2]&&ints[1]==ints[3]&&ints[1]==ints[4]){System.out.println("four card");
         return true;}
         int count=0; for(int x : ints) if(x==ints[0])count++;
         if(count==4){System.out.println("four card");return true;}
         return false;
     }
     static boolean fullH(int[] ints){
         HashSet<Integer>hs=new HashSet<Integer>();
         for(int x:ints) hs.add(x);
         if(hs.size()==2){System.out.println("full house"); return true;}
         return false;
     }
     static boolean st(int[] ints){
         TreeSet<Integer>hs=new TreeSet<Integer>();
         
         for(int x:ints) hs.add(x);
         if(hs.size()!=5)return false;
         if(hs.last()-hs.first()==4){System.out.println("straight");return true;}
         if(hs.first()==1){hs.remove(1);
             if(hs.first()==10){System.out.println("straight");return true;}
        }return false;
     }
     static boolean _3c(int[] ints){
        for(int i=0; i<5;i++){
            int count=0;
            for(int j=i+1;j<5;j++){
                if(ints[i]==ints[j])count++;
            }
            if(count==2){System.out.println("three card");return true;}
        }
        return false;
     }
     static boolean _2p(int[] ints){
         TreeMap<Integer,Integer>tm=new TreeMap<Integer,Integer>();
         for(int in:ints){
             if(tm.containsKey(in))tm.put(in, tm.get(in)+1);
             else tm.put(in, 1);
         }
         if(tm.keySet().size()==3){System.out.println("two pair");return true;}
         return false;
     }
     static boolean _1p(int[] ints){
         for(int i=0; i<5;i++){
             for(int j=i+1;j<5;j++){
                 if(ints[i]==ints[j]){System.out.println("one pair");return true;}
         }
        }return false;
     }
 }