Problem: 

Input

The first line of the input contains a single integer N (1 ≤ N ≤ 24). The next N lines contain 5 space-separated integers each. The first three integers will be between 0 and 2, inclusive. The last two integers will be between 0 and 3, inclusive. The sum of the first three integers will be equal to the sum of the last two integers.

Output

Output the result – a string of lowercase English letters.

Examples

Input


1
1 0 0 1 0


Output


a


Input


10
2 0 0 1 1
1 1 1 2 1
2 1 0 1 2
1 1 0 1 1
2 1 0 2 1
1 1 1 2 1
1 2 1 3 1
2 0 0 1 1
1 1 0 1 1
1 1 2 2 2


Output


codeforcez

Solution (in CPP):

Solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

ll p[100005],q[100005];

int main()
{
	ll t,n,i,j,a[10],b,c,e,d;
	cin>>t;
	while(t--)
	{
		scanf("%lld %lld %lld %lld %lld",&a[0],&a[1],&a[2],&a[3],&a[4]);
		ll z[30][5]={
		 1 , 0 , 0 , 1 , 0 ,
		 1 , 1 , 0 , 2 , 0 ,
		 2 , 0 , 0 , 1 , 1 ,
		 2 , 1 , 0 , 1 , 2 ,
		 1 , 1 , 0 , 1 , 1 ,
		
		 2 , 1 , 0 , 2 , 1 ,
		 2 , 2 , 0 , 2 , 2 ,
		 1 , 2 , 0 , 2 , 1 ,
		 1 , 1 , 0 , 1 , 1 ,
		 1 , 2 , 0 , 1 , 2 ,
		
		 1 , 0 , 1 , 2 , 0 ,
		 1 , 1 , 1 , 3 , 0 ,
		 2 , 0 , 1 , 2 , 1 ,
		 2 , 1 , 1 , 2 , 2 ,
		 1 , 1 , 1 , 2 , 1 ,
		
		 2 , 1 , 1 , 3 , 1 ,
		 2 , 2 , 1 , 3 , 2 ,
		 1 , 2 , 1 , 3 , 1 ,
		 1 , 1 , 1 , 2 , 1 ,
		 1 , 2 , 1 , 2 , 2 ,
		
		 1 , 0 , 2 , 2 , 1 ,
		 1 , 1 , 2 , 3 , 1 ,
		 1 , 2 , 1 , 1 , 3 ,
		 2 , 0 , 2 , 2 , 2 ,
		 2 , 1 , 2 , 2 , 3 ,
		
		 1 , 1 , 2 , 2 , 2 
		};
		for(i=0;i<26;i++)
		{
			for(j=0;j<5;j++)
			{
				if(z[i][j]!=a[j])
				    break;
			}
			if(j==5)
			{
				printf("%c",i+'a');
				break;
			}
		}
		
	}
	
	return 0;
}