/*
Author: Kanan Asgarli
*/
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <ostream>
#include <fstream>
#include <cstring>
#include <string>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <memory>
#define pi acos(-1.0)
#define MAX 1000000000
#pragma comment(linker, "/STACK:1000000000")

using namespace std;
/*
2
756914 743576
463478 13338
751135 143741
32430 14021
*/
string s[6], ans;
int tests;
int main(int argc, char *argv[])
{
    //ifstream cin("input.txt");
    //ofstream cout("output.txt");
    cin>>tests;
    while( tests-- ){
        for(int i = 1; i <= 5; i++)
            cin>>s[i];
        sort(s + 1, s + 6);
        if( s[1] == s[5] )
            ans = "poker";
        else if( s[1] == s[4] || s[2] == s[5] )
            ans = "quads";
        else if( (s[1] == s[2] && s[3] == s[5]) || (s[1] == s[3] && s[4] == s[5]) )
            ans = "full house";
        else if( s[1] == s[3] || s[2] == s[4] || s[3] == s[5] )
            ans = "set";
        else if( (s[1] == s[2] && s[3] == s[4]) || (s[2] == s[3] && s[4] == s[5]) || (s[1] == s[2] && s[4] == s[5]) )
            ans = "two pair";
        else if( s[1] == s[2] || s[2] == s[3] || s[3] == s[4] || s[4] == s[5] )
            ans = "pair";
        else
            ans = "no pair";
        cout<<ans<<endl;
    }
    //cin.close();
    //cout.close();

    return 0;
}