#include<cstdio>
const int N=100005;
int y[27]={10010,11020,20011,21012,11011,21021,22022,12021,11011,12012,10120,11130,20121,21122,11121,21131,22132,12131,11121,12122,10221,11231,12113,20222,21223,11222};
char x[30000];
int t,s,z;
int main(){
    for(int i=0;i<26;i++){
        if(!x[y[i]])x[y[i]]=i+'a';
    }
    scanf("%d",&t);
    while(t--){
        z=0;
        for(int i=0;i<5;i++)
            scanf("%d",&s),z=z*10+s;
        putchar(x[z]);
    }
    return 0;
}
### Prompt

Please provide a Cpp coded solution 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
#include<cstdio>
const int N=100005;
int y[27]={10010,11020,20011,21012,11011,21021,22022,12021,11011,12012,10120,11130,20121,21122,11121,21131,22132,12131,11121,12122,10221,11231,12113,20222,21223,11222};
char x[30000];
int t,s,z;
int main(){
    for(int i=0;i<26;i++){
        if(!x[y[i]])x[y[i]]=i+'a';
    }
    scanf("%d",&t);
    while(t--){
        z=0;
        for(int i=0;i<5;i++)
            scanf("%d",&s),z=z*10+s;
        putchar(x[z]);
    }
    return 0;
}
```