#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

char f[5][5][5][5][5];

int main(void)
{
	f[1][0][0][1][0] = 'a';
	f[1][1][0][2][0] = 'b';
	f[2][0][0][1][1] = 'c';
	f[2][1][0][1][2] = 'd';
	f[1][1][0][1][1] = 'e';
	f[2][1][0][2][1] = 'f';
	f[2][2][0][2][2] = 'g';
	f[1][2][0][2][1] = 'h';
//	f[1][1][0][1][1] = 'i';
	f[1][2][0][1][2] = 'j';
	f[1][0][1][2][0] = 'k';
	f[1][1][1][3][0] = 'l';
	f[2][0][1][2][1] = 'm';
	f[2][1][1][2][2] = 'n';
	f[1][1][1][2][1] = 'o';
	f[2][1][1][3][1] = 'p';
	f[2][2][1][3][2] = 'q';
	f[1][2][1][3][1] = 'r';
//	f[1][1][1][2][1] = 's';
	f[1][2][1][2][2] = 't';
	f[1][0][2][2][1] = 'u';
	f[1][1][2][3][1] = 'v';
	f[1][2][1][1][3] = 'w';
	f[2][0][2][2][2] = 'x';
	f[2][1][2][2][3] = 'y';
	f[1][1][2][2][2] = 'z';
	
	int n;
	scanf("%d",&n);
	while(n--)
	{
		int a,b,c,d,e;
		cin >> a >> b >> c >> d >> e;
		putchar(f[a][b][c][d][e]);
	}
	return 0;
}

### Prompt

In cpp, your task is to solve the following 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

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

char f[5][5][5][5][5];

int main(void)
{
	f[1][0][0][1][0] = 'a';
	f[1][1][0][2][0] = 'b';
	f[2][0][0][1][1] = 'c';
	f[2][1][0][1][2] = 'd';
	f[1][1][0][1][1] = 'e';
	f[2][1][0][2][1] = 'f';
	f[2][2][0][2][2] = 'g';
	f[1][2][0][2][1] = 'h';
//	f[1][1][0][1][1] = 'i';
	f[1][2][0][1][2] = 'j';
	f[1][0][1][2][0] = 'k';
	f[1][1][1][3][0] = 'l';
	f[2][0][1][2][1] = 'm';
	f[2][1][1][2][2] = 'n';
	f[1][1][1][2][1] = 'o';
	f[2][1][1][3][1] = 'p';
	f[2][2][1][3][2] = 'q';
	f[1][2][1][3][1] = 'r';
//	f[1][1][1][2][1] = 's';
	f[1][2][1][2][2] = 't';
	f[1][0][2][2][1] = 'u';
	f[1][1][2][3][1] = 'v';
	f[1][2][1][1][3] = 'w';
	f[2][0][2][2][2] = 'x';
	f[2][1][2][2][3] = 'y';
	f[1][1][2][2][2] = 'z';
	
	int n;
	scanf("%d",&n);
	while(n--)
	{
		int a,b,c,d,e;
		cin >> a >> b >> c >> d >> e;
		putchar(f[a][b][c][d][e]);
	}
	return 0;
}

```