#include <bits/stdc++.h>
using namespace std;

#define fio                           \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL)
#define ll long long int
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define MOD 1000000007

int main()
{
    fio;
    int code[26] = {
        10010,
        11020,
        20011,
        21012,
        11011,
        21021,
        22022,
        12021,
        00000,
        12012,
        10120,
        11130,
        20121,
        21122,
        11121,
        21131,
        22132,
        12131,
        11111,
        12122,
        10221,
        11231,
        12113,
        20222,
        21223,
        11222};
    map<int, char> dict;
    dict.clear();
    for (int i = 0; i < 26; i++)
    {
        dict[code[i]] = 'a' + i;
        // cout << i << " " << dict[code[i]] << endl;
    }
    int n, x, c;
    cin >> n;
    while (n--)
    {
        c = 0;
        for (int i = 0; i < 5; i++)
        {
            cin >> x;
            c += x;
            c *= 10;
        }
        c /= 10;
        // cout << "W" << c << endl;
        cout << dict[c];
    }
    cout << endl;
    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
#include <bits/stdc++.h>
using namespace std;

#define fio                           \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL)
#define ll long long int
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define MOD 1000000007

int main()
{
    fio;
    int code[26] = {
        10010,
        11020,
        20011,
        21012,
        11011,
        21021,
        22022,
        12021,
        00000,
        12012,
        10120,
        11130,
        20121,
        21122,
        11121,
        21131,
        22132,
        12131,
        11111,
        12122,
        10221,
        11231,
        12113,
        20222,
        21223,
        11222};
    map<int, char> dict;
    dict.clear();
    for (int i = 0; i < 26; i++)
    {
        dict[code[i]] = 'a' + i;
        // cout << i << " " << dict[code[i]] << endl;
    }
    int n, x, c;
    cin >> n;
    while (n--)
    {
        c = 0;
        for (int i = 0; i < 5; i++)
        {
            cin >> x;
            c += x;
            c *= 10;
        }
        c /= 10;
        // cout << "W" << c << endl;
        cout << dict[c];
    }
    cout << endl;
    return 0;
}
```