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;
int n;
int a[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,
	0,0,0,0,0,
	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,
	0,0,0,0,0,
	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
};
int main()
{
	cin>>n;
	for(int k=1;k<=n;k++)
	{
		int p[5];
		for(int i=0;i<=4;i++) cin>>p[i];
		for(int i=0;i<26;i++)
		{
			bool flag=1;
			for(int j=0;j<=4;j++)
			{
				if(a[i][j]!=p[j]) flag=0;
			}
			if(flag) printf("%c",'a'+i);
		}
	}
}