#include "bits/stdc++.h"

using namespace std;

string alpha[26] = {
	"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"
};

int main() {
	int n;
	string s;
	cin >> n;
	cin.ignore();
	unordered_map<string, char> m;
	for (int i = 25; i >= 0; i--) {
		m[alpha[i]] = 'a' + i;
	}
	for (int i = 0; i < n; i++) {
		getline(cin, s);
		putchar(m[s]);
	}
	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;

string alpha[26] = {
	"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"
};

int main() {
	int n;
	string s;
	cin >> n;
	cin.ignore();
	unordered_map<string, char> m;
	for (int i = 25; i >= 0; i--) {
		m[alpha[i]] = 'a' + i;
	}
	for (int i = 0; i < n; i++) {
		getline(cin, s);
		putchar(m[s]);
	}
	return 0;
}


```