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

Solution (in CPP):

Solution:
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using Prior = std::priority_queue<T>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define eb emplace_back
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)

int a[26] = {
    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,
};

void solve() {
    int num = 0, tmp;
    cin >> tmp, num += 10000 * tmp;
    cin >> tmp, num += 1000 * tmp;
    cin >> tmp, num += 100 * tmp;
    cin >> tmp, num += 10 * tmp;
    cin >> tmp, num += 1 * tmp;
    for (int i = 0; i < 26; ++i) {
        if (num == a[i]) return cout << (char)('a'+i), void();
    }
}

int32_t main() {
    fastIO();
    
    int t = 1; cin >> t;
    while (t--) solve();
    cout << "\n";
    
    return 0;
}