#include <bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;

const int N = 2e5 + 5;

#define MOD 1000000007

char grid[11][11];

bool comp(int a[], string s) {
    for (int i = 0; i < 5; i++) {
        if (a[i] != s[i] - '0') {
            return false;
        }
    }

    return true;
}

int main() {
    ios_base::sync_with_stdio(false);

    string alpha[] = {
        "10010",    // a
        "11020",    // b
        "20011",    // c
        "21012",    // d
        "11011",    // e
        "21021",    // f
        "22022",    // g
        "12021",    // h
        "11011",    // i
        "12012",    // j

        "10120",    // k
        "11130",    // l
        "20121",    // m
        "21122",    // n
        "11121",    // o
        "21131",    // p
        "22132",    // q
        "12131",    // r
        "11121",    // s
        "12122",    // t

        "10221",    // u
        "11231",    // v
        "12113",    // w
        "20222",    // x
        "21223",    // y
        "11222",    // z
    };

    int n; cin >> n;

    string res;
    for (int i = 0; i < n; i++) {
        int a[5];

        for (int j = 0; j < 5; j++)
            cin >> a[j];

        char c = '#';
        for (int j = 0; j < 26; j++) {
            if (comp(a, alpha[j])) {
                c = j + 'a';
                break;
            }
        }

        res += c;
    }

    cout << res << "\n";

    return 0;
}




### 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
#include <bits/stdc++.h>

using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;

const int N = 2e5 + 5;

#define MOD 1000000007

char grid[11][11];

bool comp(int a[], string s) {
    for (int i = 0; i < 5; i++) {
        if (a[i] != s[i] - '0') {
            return false;
        }
    }

    return true;
}

int main() {
    ios_base::sync_with_stdio(false);

    string alpha[] = {
        "10010",    // a
        "11020",    // b
        "20011",    // c
        "21012",    // d
        "11011",    // e
        "21021",    // f
        "22022",    // g
        "12021",    // h
        "11011",    // i
        "12012",    // j

        "10120",    // k
        "11130",    // l
        "20121",    // m
        "21122",    // n
        "11121",    // o
        "21131",    // p
        "22132",    // q
        "12131",    // r
        "11121",    // s
        "12122",    // t

        "10221",    // u
        "11231",    // v
        "12113",    // w
        "20222",    // x
        "21223",    // y
        "11222",    // z
    };

    int n; cin >> n;

    string res;
    for (int i = 0; i < n; i++) {
        int a[5];

        for (int j = 0; j < 5; j++)
            cin >> a[j];

        char c = '#';
        for (int j = 0; j < 26; j++) {
            if (comp(a, alpha[j])) {
                c = j + 'a';
                break;
            }
        }

        res += c;
    }

    cout << res << "\n";

    return 0;
}




```