#include<bits/stdc++.h>
using namespace std;
int x[233][233]={
{1,0,0,0,0,0},
{1,0,1,0,0,0},
{1,1,0,0,0,0},
{1,1,0,1,0,0},
{1,0,0,1,0,0},
{1,1,1,0,0,0},
{1,1,1,1,0,0},
{1,0,1,1,0,0},
{0,1,1,0,0,0},
{0,1,1,1,0,0},
{1,0,0,0,1,0},
{1,0,1,0,1,0},
{1,1,0,0,1,0},
{1,1,0,1,1,0},//n
{1,0,0,1,1,0},
{1,1,1,0,1,0},
{1,1,1,1,1,0},
{1,0,1,1,1,0},
{0,1,1,0,1,0},
{0,1,1,1,1,0},
{1,0,0,0,1,1},//u
{1,0,1,0,1,1},
{0,1,1,1,0,1},
{1,1,0,0,1,1},
{1,1,0,1,1,1},
{1,0,0,1,1,1}
};
int n,a,c,b,d,e;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a>>b>>c>>d>>e;
		for(char ch='a';ch<='z';ch++)
		{
			auto z=x[ch-'a'];
			int aa=z[0]+z[1];
			int bb=z[2]+z[3];
			int cc=z[4]+z[5];
			int dd=z[0]+z[2]+z[4];
			int ee=z[1]+z[3]+z[5];
			if(aa==a&&bb==b&&cc==c&&dd==d&&ee==e)
			{
				cout<<ch;
				break;
			}
		}
	}
	
	return 0;
}
### Prompt

Please provide a CPP coded solution to the problem described below:



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

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
int x[233][233]={
{1,0,0,0,0,0},
{1,0,1,0,0,0},
{1,1,0,0,0,0},
{1,1,0,1,0,0},
{1,0,0,1,0,0},
{1,1,1,0,0,0},
{1,1,1,1,0,0},
{1,0,1,1,0,0},
{0,1,1,0,0,0},
{0,1,1,1,0,0},
{1,0,0,0,1,0},
{1,0,1,0,1,0},
{1,1,0,0,1,0},
{1,1,0,1,1,0},//n
{1,0,0,1,1,0},
{1,1,1,0,1,0},
{1,1,1,1,1,0},
{1,0,1,1,1,0},
{0,1,1,0,1,0},
{0,1,1,1,1,0},
{1,0,0,0,1,1},//u
{1,0,1,0,1,1},
{0,1,1,1,0,1},
{1,1,0,0,1,1},
{1,1,0,1,1,1},
{1,0,0,1,1,1}
};
int n,a,c,b,d,e;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a>>b>>c>>d>>e;
		for(char ch='a';ch<='z';ch++)
		{
			auto z=x[ch-'a'];
			int aa=z[0]+z[1];
			int bb=z[2]+z[3];
			int cc=z[4]+z[5];
			int dd=z[0]+z[2]+z[4];
			int ee=z[1]+z[3]+z[5];
			if(aa==a&&bb==b&&cc==c&&dd==d&&ee==e)
			{
				cout<<ch;
				break;
			}
		}
	}
	
	return 0;
}
```