#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define FIO ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define FOR(j,n) for(int i=j;i<=n;i++)
#define REVERSE(j,n) for(int i=j;i>=n;i--)
#define fi first
#define se second
#define mod 1000000007
#define pb push_back
#define pii pair<int,int>
#define mp make_pair

lli A[10000000] = {0};	

int main()
{
	map<int,char> q;
	q.insert(pair<int,char>(10010,'a'));
	q.insert(pair<int,char>(11020,'b'));
	q.insert(pair<int,char>(20011,'c'));
	q.insert(pair<int,char>(21012,'d'));
	q.insert(pair<int,char>(11011,'e'));
	q.insert(pair<int,char>(21021,'f'));
	q.insert(pair<int,char>(22022,'g'));
	q.insert(pair<int,char>(12021,'h'));
	// q.insert(pair<int,char>(11011,'i'));
	q.insert(pair<int,char>(12012,'j'));
	q.insert(pair<int,char>(10120,'k'));
	q.insert(pair<int,char>(11130,'l'));
	q.insert(pair<int,char>(20121,'m'));
	q.insert(pair<int,char>(21122,'n'));
	q.insert(pair<int,char>(11121,'o'));
	q.insert(pair<int,char>(21131,'p'));
	q.insert(pair<int,char>(22132,'q'));
	q.insert(pair<int,char>(12131,'r'));
	q.insert(pair<int,char>(11121,'s'));
	q.insert(pair<int,char>(12122,'t'));
	q.insert(pair<int,char>(10221,'u'));
	q.insert(pair<int,char>(11231,'v'));
	q.insert(pair<int,char>(12113,'w'));
	q.insert(pair<int,char>(20222,'x'));
	q.insert(pair<int,char>(21223,'y'));
	q.insert(pair<int,char>(11222,'z'));
	int n;
	cin >> n;
	int sum;
	string s = "";
	while(n--)
	{
		sum = 1;
		for(int i=0;i<5;i++)
		{
			int val;
			cin >> val;
			if(i==0)
				sum = val;
			else
			{
				sum *= 10;
				sum += val;
			}
		}
		s += q[sum];
	}
	cout << s << "\n";
	return 0;
}	

### Prompt

Your task is to create a Cpp solution to 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
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define FIO ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define FOR(j,n) for(int i=j;i<=n;i++)
#define REVERSE(j,n) for(int i=j;i>=n;i--)
#define fi first
#define se second
#define mod 1000000007
#define pb push_back
#define pii pair<int,int>
#define mp make_pair

lli A[10000000] = {0};	

int main()
{
	map<int,char> q;
	q.insert(pair<int,char>(10010,'a'));
	q.insert(pair<int,char>(11020,'b'));
	q.insert(pair<int,char>(20011,'c'));
	q.insert(pair<int,char>(21012,'d'));
	q.insert(pair<int,char>(11011,'e'));
	q.insert(pair<int,char>(21021,'f'));
	q.insert(pair<int,char>(22022,'g'));
	q.insert(pair<int,char>(12021,'h'));
	// q.insert(pair<int,char>(11011,'i'));
	q.insert(pair<int,char>(12012,'j'));
	q.insert(pair<int,char>(10120,'k'));
	q.insert(pair<int,char>(11130,'l'));
	q.insert(pair<int,char>(20121,'m'));
	q.insert(pair<int,char>(21122,'n'));
	q.insert(pair<int,char>(11121,'o'));
	q.insert(pair<int,char>(21131,'p'));
	q.insert(pair<int,char>(22132,'q'));
	q.insert(pair<int,char>(12131,'r'));
	q.insert(pair<int,char>(11121,'s'));
	q.insert(pair<int,char>(12122,'t'));
	q.insert(pair<int,char>(10221,'u'));
	q.insert(pair<int,char>(11231,'v'));
	q.insert(pair<int,char>(12113,'w'));
	q.insert(pair<int,char>(20222,'x'));
	q.insert(pair<int,char>(21223,'y'));
	q.insert(pair<int,char>(11222,'z'));
	int n;
	cin >> n;
	int sum;
	string s = "";
	while(n--)
	{
		sum = 1;
		for(int i=0;i<5;i++)
		{
			int val;
			cin >> val;
			if(i==0)
				sum = val;
			else
			{
				sum *= 10;
				sum += val;
			}
		}
		s += q[sum];
	}
	cout << s << "\n";
	return 0;
}	

```