

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>
typedef long long ll;

using namespace std;

ll MOD = (ll)1000000007;
vector<int> nums;
bool taken[200020];
int boop[26][5] = {
    {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::sync_with_stdio(false);
    cin.tie(0);
    int t, m, n;
    ll k, ans = 0;
    string s1, s2;
    bool sad = false;
    cin >> t;
    while(t--) {
        vector<int>().swap(nums);
        nums.resize(5);
        for(int i = 0; i < 5; i++) cin >> nums[i];
        for(int i = 0; i < 26; i++) {
            sad = false;
            for(int j = 0; j < 5; j++) {
                if(nums[j] != boop[i][j]) sad = true;
            }
            if(!sad) {
                cout << (char)('a' + i);
                break;
            }
        }
    }
    cout << '\n';
}