#include<set>
#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<math.h>
#include<time.h>
#include<vector>
#include<bitset>
#include<memory>
#include<utility>
#include<fstream>
#include<stdio.h>
#include<sstream>
#include<iostream>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[35][8]={
{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()
{
    #ifdef absi2011
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    int n;
    scanf("%d",&n);
    int b[5];
    int i;
    for (i=0;i<n;i++)
    {
        int j;
        for (j=0;j<5;j++)
        {
            scanf("%d",&b[j]);
        }
        for (j=0;j<26;j++)
        {
            int k;
            for (k=0;k<5;k++)
            {
                if ((b[k]!=a[j][k]))
                {
                    break;
                }
            }
            if (k==5)
            {
                printf("%c",'a'+j);
                break;
            }
        }
    }
    return 0;
} 
