#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <set>

//#define PRO 'A'
//#define PRO 'B'
//#define PRO 'C'
//#define PRO 'D'
//#define PRO 'E'
//#define PRO 'F'
#define PRO 'G'
//#define PRO 'H'
//#define PRO 'I'


using namespace std;

#if (PRO == 'A')

#endif // (PRO == 'A')

#if (PRO == 'B')

#endif // (PRO == 'A')

#if (PRO == 'C')

#endif // (PRO == 'A')

#if (PRO == 'D')

#endif // (PRO == 'A')

#if (PRO == 'E')

#define N (5+2)



#endif // (PRO == 'A')

#if (PRO == 'F')

#endif // (PRO == 'A')

#if (PRO == 'G')

map <string, char> mp = { {"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'} };

#endif // (PRO == 'A')

#if (PRO == 'H')

#endif // (PRO == 'A')

#if (PRO == 'I')

#endif // (PRO == 'A')




int main()
{
#if (PRO == 'A')
    char ch;
    while ((ch = getchar()) != EOF) {
        if(ch == '\n')
            cout << "NO" << endl;
    }






    //cout << "Hello World!\n";
#endif // (PRO == 'A')

#if (PRO == 'B')
    int x;
    int tmp;
    cin >> x;
    while (x > 9) {
        tmp = 0;
        while (x > 0) {
            tmp += (x % 10);
            x /= 10;
        }
        x = tmp;
    }
    cout << x << endl;
    
    //cout << "Hello World!\n";
#endif // (PRO == 'B')

#if (PRO == 'C')
    char ch;
    int x[2], op = 0, cnt = 0;
    bool flag = 1;
    while ((ch = getchar()) != EOF) {
        if ('A' <= ch && ch <= 'Z') {
            //x[op] = (ch - 'A');
            //cout << (ch - 'A') << endl;
            if (cnt >= 2 && (x[0] + x[1]) % 26 != ((ch - 'A') % 26)) {
                flag = 0;
            }
            x[op] = (ch - 'A') % 26;
            op ^= 1;
            cnt++;
        }
    }
    if (flag) {
        cout << "YES" << endl;
    }
    else {
        cout << "NO" << endl;
    }
    
    
    
    
    
    //cout << "Hello World!\n";
#endif // (PRO == 'C')

#if (PRO == 'D')
    int n, m;
    bool use[16 + 2];
    cin >> n >> m;
    memset(use, 0, sizeof(use));
    while (n) {
        if (use[n % m]) {
            cout << "NO" << endl;
            return 0;
        }
        use[n % m] = 1;
        n /= m;
    }
    cout << "YES" << endl;
    
    
    
    
    //cout << "Hello World!\n";
#endif // (PRO == 'D')

#if (PRO == 'E')
    int mat[N][N];
    //int ans[N][N];
    int ans;
    int h, w;
    int i, j;
    char ch;
    cin >> h >> w;
    for (i = 0; i < h; i++) {
        for (j = 0; j < w; j++) {
            ch = getchar();
            if (ch == '*') {
                mat[i][j] = 1;
            }
            else if (ch == '.') {
                mat[i][j] = 0;
            }
            else {
                j--;
                continue;
            }
        }
    }
    //memset(ans, 0, sizeof(ans));
    if (mat[0][0]) {
        ans = 1;
    }
    else {
        ans = 0;
    }
    i = 0;
    j = 0;
    while (i < h && j < w) {
        if (i == h - 1 && j == w - 1) {
            break;
        }
        if (i == h - 1) {
            j++;
            ans += mat[i][j];
            continue;
        }
        if (j == w - 1) {
            i++;
            ans += mat[i][j];
            continue;
        }
        if (mat[i][j + 1] >= mat[i + 1][j]) {
            j++;
            ans += mat[i][j];
        }
        else {
            i++;
            ans += mat[i][j];
        }
    }
    cout << ans << endl;
    /*
    for (int i = 0; i < h; i++) {
        for (int j = 0; j < w; j++) {
            if (i == 0 && j == 0) {
                continue;
            }
            if (i > 0) {
                ans[i][j] = max(ans[i][j], ans[i - 1][j]);
            }
            if (j > 0) {
                ans[i][j] = max(ans[i][j], ans[i][j - 1]);
            }
            if (mat[i][j]) {
                ans[i][j]++;
            }
        }
    }
    cout << ans[h - 1][w - 1] << endl;*/
    
    
    
    
    //cout << "Hello World!\n";
#endif // (PRO == 'E')

#if (PRO == 'F')
    int x;
    cin >> x;
    cout << 2 - x * x << endl;
    //cout << "Hello World!\n";
#endif // (PRO == 'F')

#if (PRO == 'G')
    int n, x;
    string s, ans = "";
    cin >> n;
    while (n--) {
        s = "";
        for (int i = 0; i < 5; i++) {
            cin >> x;
            s.push_back('0' + x);
        }
        //cout << s << endl;
        //cout << mp[s];
        ans.push_back(mp[s]);
    }
    cout << ans;
    
    
    
    //cout << "Hello World!\n";
#endif // (PRO == 'G')

#if (PRO == 'H')
    cout << "password";
#endif // (PRO == 'H')

#if (PRO == 'I')
    //cout << "Hello World!\n";
#endif // (PRO == 'I')



    //cout << "Hello World!\n";
    return 0;
}
