#pragma GCC optimize("O2")
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007LL
#define eps 1e-8

using namespace std;

string a3[3]={"aa.","..b","..b"};
string a4[4]={"aabc","ddbc","efgg","efhh"};
string a5[5]={"aabbc","dde.c","ffegg","..hij","..hij"};
string a6[6]={"aabbcc","ddeeff","ghi...","ghi...","...jkl","...jkl"};
string a7[7]={"aabbcc.","ddeef..","gg..fhh","..ij..k","..ij..k","....lmn","....lmn"};
string *ap[8]={NULL,NULL,NULL,a3,a4,a5,a6,a7};
string a[1005];

int main()
{
	cin.tie(0),ios::sync_with_stdio(0);
	int n;
	cin>>n;
	if(n<3) cout<<"-1\n";
	else if(n==3){
		for(int i=0;i<3;i++)
			cout<<a3[i]<<"\n";
		cout<<"\n";
	}
	else{
		fill(a,a+n,string(n,'.'));
		while(n>=8){
			for(int i=0;i<4;i++){
				for(int j=0;j<4;j++)
					a[i+n-4][j+n-4]=a4[i][j];
			}
			n-=4;
		}
		for(int i=0;i<n;i++){
			for(int j=0;j<n;j++)
				a[i][j]=ap[n][i][j];
		}
		n=a[0].size();
		for(int i=0;i<n;i++)
			cout<<a[i]<<"\n";
	}
	return 0;
}
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<map>
using namespace std;
int main(){
  for(;;){
    vector<int> lot(5);
    int ans = 0;
    if(scanf("%d",&lot[0]) == EOF) break;
    for(int i=1; i<5; i++) scanf(",%d",&lot[i]);
    sort(lot.begin(),lot.end());
    map<int,int> card;
    for(int i=0; i<5; i++) card[lot[i]]++;
    for(map<int,int>::iterator it = card.begin(); it!=card.end(); it++){
      if(it->second == 2) ans+=2; 
      if(it->second == 3) ans+=3;
      if(it->second == 4) ans+=6;
    }
    if(ans == 2) cout <<"one pair"<<endl;
    if(ans == 3) cout <<"three card"<<endl;
    if(ans == 4) cout <<"two pair"<<endl;
    if(ans == 5) cout <<"full house"<<endl;
    if(ans == 6) cout <<"four card"<<endl;
    if(lot[0]+1 == lot[1] && lot[1]+1 == lot[2] && lot[2]+1 == lot[3] && lot[3]+1 == lot[4]) cout <<"straight"<<endl;
    else if(lot[0] == 1 && lot[1] == 10 && lot[2] == 11 && lot[3] == 12 && lot[4] == 13) cout <<"straight"<<endl;
    else if(ans == 0) cout<<"null"<<endl;
  }
  return 0;
}