

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
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pp pop_back
#define mp make_pair
#define bb back
#define ff first
#define ss second

using namespace std;

/*
 ____     __    _______    _______   __________
|     \  |  |  |  _____|  /  _____) |____  ____|
|  |\  \ |  |  | |__     (  (_____      |  |
|  | \  \|  |  |  __|     \_____  \     |  | 
|  |  \     |  | |_____    _____)  )    |  | 
|__|   \____|  |_______|  (_______/     |__| 
*/

vector<vector<int> > c = {{1, 0, 0, 1, 0},{1, 1, 0, 2, 0},{2, 0, 0, 1, 1},{2, 1, 0, 1, 2},{1, 1, 0, 1, 1},{2, 1, 0, 2, 1},{2, 2, 0, 2, 2},{1, 2, 0, 2, 1},{1, 1, 0, 1, 1},{1, 2, 0, 1, 2},{1, 0, 1, 2, 0},{1, 1, 1, 3, 0},{2, 0, 1, 2, 1},{2, 1, 1, 2, 2},{1, 1, 1, 2, 1},{2, 1, 1, 3, 1},{2, 2, 1, 3, 2},{1, 2, 1, 3, 1},{1, 1, 1, 2, 1},{1, 2, 1, 2, 2},{1, 0, 2, 2, 1},{1, 1, 2, 3, 1},{1, 2, 1, 1, 3},{2, 0, 2, 2, 2},{2, 1, 2, 2, 3},{1, 1, 2, 2, 2}};

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        vector<int> nums(5);
        for (int j = 0; j < 5; j++)
            cin >> nums[j];
        for (int j = 0; j < 26; j++) {
            int k = 0;
            for (; k < 5; k++)
                if (nums[k] != c[j][k])
                    break;
            if (k == 5) {
                cout << (char)(j + 'a');
                break;
            }
        }
    }
    cout << '\n';
    return 0;
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
    * DON'T GET STUCK ON ONE APPROACH


    a = 1 0 0 1 0

    c = 2 0 0 1 1
    d = 2 1 0 1 2
    e = 1 1 0 1 1 
    f = 2 1 0 2 1

    o = 1 1 1 2 1
    z = 1 1 2 2 2
*/