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 <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <utility>
#include <iostream>
#include <fstream>
#include <vector>
#include <set>

using namespace std;

int main() {
    
    char braille[5][5][5][5][5];
    memset(braille, ' ', sizeof(braille));

	braille[1][0][0][1][0]='a';
	braille[1][1][0][2][0]='b';
	braille[2][0][0][1][1]='c';
	braille[2][1][0][1][2]='d';
	braille[1][1][0][1][1]='e';
	braille[2][1][0][2][1]='f';
	braille[2][2][0][2][2]='g';
	braille[1][2][0][2][1]='h';
	braille[1][2][0][1][2]='j';
	braille[1][0][1][2][0]='k';
	braille[1][1][1][3][0]='l';
	braille[2][0][1][2][1]='m';
	braille[2][1][1][2][2]='n';
	braille[1][1][1][2][1]='o';
	braille[2][1][1][3][1]='p';
	braille[2][2][1][3][2]='q';
	braille[1][2][1][3][1]='r';
	braille[1][2][1][2][2]='t';
	braille[1][0][2][2][1]='u';
	braille[1][1][2][3][1]='v';
	braille[1][2][1][1][3]='w';
	braille[2][0][2][2][2]='x';
	braille[2][1][2][2][3]='y';
	braille[1][1][2][2][2]='z';

	int n;
	cin >> n;

	while(n--) {
		int a, b, c, d, e;
		cin >> a >> b >> c >> d >> e;
		cout << braille[a][b][c][d][e];
	}
	return 0;
}