//Template Made By: Ojassvi Kumar
#include<bits/stdc++.h>
using namespace std;
 
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long int
#define fo(i,a,b) for(long long int i=a; i<b; i++)
#define endl "\n"
#define max3(a,b,c) max(max((a),(b)),(c))
#define max4(a,b,c,d) max(max((a),(b)),max((c),(d)))
#define min3(a,b,c) min(min((a),(b)),(c))
#define min4(a,b,c,d) min(min((a),(b)),min((c),(d)))
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(V) V.begin(),V.end()
#define itv vector<long long int>::iterator
#define pll pair<long long int,long long int>
#define mp make_pair
#define itp vector<pair<long long int,long long int>>::iterator
#define sll set<long long int,greater<long long int>>
#define its set<long long int,greater<long long int>>::iterator
#define d0(x) cout<<(x)<<" "
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
 
//const long double pi = 3.14159265358979323846264338;
//Template Ends
char Brail(ll A1,ll A2,ll A3,ll B1,ll B2){
    char B[10][10][10][10][10];
    B[1][0][0][1][0]='a';
	B[1][1][0][2][0]='b';
	B[2][0][0][1][1]='c';
	B[2][1][0][1][2]='d';
	B[1][1][0][1][1]='e';
	B[2][1][0][2][1]='f';
	B[2][2][0][2][2]='g';
	B[1][2][0][2][1]='h';
	B[1][2][0][1][2]='j';
	B[1][0][1][2][0]='k';
	B[1][1][1][3][0]='l';
	B[2][0][1][2][1]='m';
	B[2][1][1][2][2]='n';
	B[1][1][1][2][1]='o';
	B[2][1][1][3][1]='p';
	B[2][2][1][3][2]='q';
	B[1][2][1][3][1]='r';
	B[1][2][1][2][2]='t';
	B[1][0][2][2][1]='u';
	B[1][1][2][3][1]='v';
	B[1][2][1][1][3]='w';
	B[2][0][2][2][2]='x';
	B[2][1][2][2][3]='y';
	B[1][1][2][2][2]='z';
    return B[A1][A2][A3][B1][B2];
}
int main(){
    ios
    #ifndef ONLINE_JUDGE
    freopen("INPUT.txt", "r", stdin);
    freopen("OUTPUT.txt", "w", stdout);
    #endif
    ll Tests=1;
//    cin>>Tests;
    while(Tests--){
        ll N;
        cin>>N;
        string S;
        while(N--){
            ll a,b,c,d,e;
            cin>>a>>b>>c>>d>>e;
            S.pb(Brail(a,b,c,d,e));
        }
        cout<<S<<endl;
    }
}
### Prompt

Develop a solution in Cpp 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
//Template Made By: Ojassvi Kumar
#include<bits/stdc++.h>
using namespace std;
 
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long int
#define fo(i,a,b) for(long long int i=a; i<b; i++)
#define endl "\n"
#define max3(a,b,c) max(max((a),(b)),(c))
#define max4(a,b,c,d) max(max((a),(b)),max((c),(d)))
#define min3(a,b,c) min(min((a),(b)),(c))
#define min4(a,b,c,d) min(min((a),(b)),min((c),(d)))
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(V) V.begin(),V.end()
#define itv vector<long long int>::iterator
#define pll pair<long long int,long long int>
#define mp make_pair
#define itp vector<pair<long long int,long long int>>::iterator
#define sll set<long long int,greater<long long int>>
#define its set<long long int,greater<long long int>>::iterator
#define d0(x) cout<<(x)<<" "
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
 
//const long double pi = 3.14159265358979323846264338;
//Template Ends
char Brail(ll A1,ll A2,ll A3,ll B1,ll B2){
    char B[10][10][10][10][10];
    B[1][0][0][1][0]='a';
	B[1][1][0][2][0]='b';
	B[2][0][0][1][1]='c';
	B[2][1][0][1][2]='d';
	B[1][1][0][1][1]='e';
	B[2][1][0][2][1]='f';
	B[2][2][0][2][2]='g';
	B[1][2][0][2][1]='h';
	B[1][2][0][1][2]='j';
	B[1][0][1][2][0]='k';
	B[1][1][1][3][0]='l';
	B[2][0][1][2][1]='m';
	B[2][1][1][2][2]='n';
	B[1][1][1][2][1]='o';
	B[2][1][1][3][1]='p';
	B[2][2][1][3][2]='q';
	B[1][2][1][3][1]='r';
	B[1][2][1][2][2]='t';
	B[1][0][2][2][1]='u';
	B[1][1][2][3][1]='v';
	B[1][2][1][1][3]='w';
	B[2][0][2][2][2]='x';
	B[2][1][2][2][3]='y';
	B[1][1][2][2][2]='z';
    return B[A1][A2][A3][B1][B2];
}
int main(){
    ios
    #ifndef ONLINE_JUDGE
    freopen("INPUT.txt", "r", stdin);
    freopen("OUTPUT.txt", "w", stdout);
    #endif
    ll Tests=1;
//    cin>>Tests;
    while(Tests--){
        ll N;
        cin>>N;
        string S;
        while(N--){
            ll a,b,c,d,e;
            cin>>a>>b>>c>>d>>e;
            S.pb(Brail(a,b,c,d,e));
        }
        cout<<S<<endl;
    }
}
```