#include <cstdio>
#include <map>

int main(){

	long num[] = {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};
    std::map<long, char> m;
    for(long p = 0; p < 26; p++){
        if(m[num[p]]){continue;}
        m[num[p]] = 'a' + p;
    }

    long t; scanf("%ld", &t);
    while(t--){
        long cur(0);
        for(long p = 0; p < 5; p++){long s; scanf("%ld", &s), cur = cur * 10 + s;}
        printf("%c", m[cur]);
    }

    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 <cstdio>
#include <map>

int main(){

	long num[] = {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};
    std::map<long, char> m;
    for(long p = 0; p < 26; p++){
        if(m[num[p]]){continue;}
        m[num[p]] = 'a' + p;
    }

    long t; scanf("%ld", &t);
    while(t--){
        long cur(0);
        for(long p = 0; p < 5; p++){long s; scanf("%ld", &s), cur = cur * 10 + s;}
        printf("%c", m[cur]);
    }

    return 0;
}
```