code

#include<bits/stdc++.h>
using namespace std;
#define p printf("bug\n");
#define co(q) cout<<q<<endl;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#define FastRead     ios_base::sync_with_stdio(false);cin.tie(NULL);
string alphabest[30][30];
string input[10];
string words[30];

void comp()
{

    for(int i=0; i<26; i++)
    {
        int flg=0;
        for(int j=0; j<7; j++)
            if(words[j]==alphabest[i][j])
                flg++;
        if(flg==7)
        {
          printf("%c",i+65);
            return;
        }
    }
}

int main()
{
//freopen("output.txt", "w", stdout);

    alphabest[0][0]=".***.";
    alphabest[0][1]="*...*";
    alphabest[0][2]="*...*";
    alphabest[0][3]="*****";
    alphabest[0][4]="*...*";
    alphabest[0][5]="*...*";
    alphabest[0][6]="*...*";

    alphabest[1][0]="****.";
    alphabest[1][1]="*...*";
    alphabest[1][2]="*...*";
    alphabest[1][3]="****.";
    alphabest[1][4]="*...*";
    alphabest[1][5]="*...*";
    alphabest[1][6]="****.";

    alphabest[2][0]=".***.";
    alphabest[2][1]="*...*";
    alphabest[2][2]="*....";
    alphabest[2][3]="*....";
    alphabest[2][4]="*....";
    alphabest[2][5]="*...*";
    alphabest[2][6]=".***.";

    alphabest[3][0]="****.";
    alphabest[3][1]="*...*";
    alphabest[3][2]="*...*";
    alphabest[3][3]="*...*";
    alphabest[3][4]="*...*";
    alphabest[3][5]="*...*";
    alphabest[3][6]="****.";

    alphabest[4][0]="*****";
    alphabest[4][1]="*....";
    alphabest[4][2]="*....";
    alphabest[4][3]="****.";
    alphabest[4][4]="*....";
    alphabest[4][5]="*....";
    alphabest[4][6]="*****";

    alphabest[5][0]="*****";
    alphabest[5][1]="*....";
    alphabest[5][2]="*....";
    alphabest[5][3]="****.";
    alphabest[5][4]="*....";
    alphabest[5][5]="*....";
    alphabest[5][6]="*....";

    alphabest[6][0]=".***.";
    alphabest[6][1]="*...*";
    alphabest[6][2]="*....";
    alphabest[6][3]="*....";
    alphabest[6][4]="*..**";
    alphabest[6][5]="*...*";
    alphabest[6][6]=".***.";

    alphabest[7][0]="*...*";
    alphabest[7][1]="*...*";
    alphabest[7][2]="*...*";
    alphabest[7][3]="*****";
    alphabest[7][4]="*...*";
    alphabest[7][5]="*...*";
    alphabest[7][6]="*...*";

    alphabest[8][0]=".***.";
    alphabest[8][1]="..*..";
    alphabest[8][2]="..*..";
    alphabest[8][3]="..*..";
    alphabest[8][4]="..*..";
    alphabest[8][5]="..*..";
    alphabest[8][6]=".***.";

    alphabest[9][0]="..***";
    alphabest[9][1]="...*.";
    alphabest[9][2]="...*.";
    alphabest[9][3]="...*.";
    alphabest[9][4]="...*.";
    alphabest[9][5]="*..*.";
    alphabest[9][6]=".**..";

    alphabest[10][0]="*...*";
    alphabest[10][1]="*..*.";
    alphabest[10][2]="*.*..";
    alphabest[10][3]="**...";
    alphabest[10][4]="*.*..";
    alphabest[10][5]="*..*.";
    alphabest[10][6]="*...*";

    alphabest[11][0]="*....";
    alphabest[11][1]="*....";
    alphabest[11][2]="*....";
    alphabest[11][3]="*....";
    alphabest[11][4]="*....";
    alphabest[11][5]="*....";
    alphabest[11][6]="*****";

    alphabest[12][0]="*...*";
    alphabest[12][1]="**.**";
    alphabest[12][2]="*.*.*";
    alphabest[12][3]="*.*.*";
    alphabest[12][4]="*...*";
    alphabest[12][5]="*...*";
    alphabest[12][6]="*...*";


    alphabest[13][0]="*...*";
    alphabest[13][1]="*...*";
    alphabest[13][2]="**..*";
    alphabest[13][3]="*.*.*";
    alphabest[13][4]="*..**";
    alphabest[13][5]="*...*";
    alphabest[13][6]="*...*";


    alphabest[14][0]=".***.";
    alphabest[14][1]="*...*";
    alphabest[14][2]="*...*";
    alphabest[14][3]="*...*";
    alphabest[14][4]="*...*";
    alphabest[14][5]="*...*";
    alphabest[14][6]=".***.";

    alphabest[15][0]="****.";
    alphabest[15][1]="*...*";
    alphabest[15][2]="*...*";
    alphabest[15][3]="****.";
    alphabest[15][4]="*....";
    alphabest[15][5]="*....";
    alphabest[15][6]="*....";

    alphabest[16][0]=".***.";
    alphabest[16][1]="*...*";
    alphabest[16][2]="*...*";
    alphabest[16][3]="*...*";
    alphabest[16][4]="*.*.*";
    alphabest[16][5]="*..*.";
    alphabest[16][6]=".**.*";

    alphabest[17][0]="****.";
    alphabest[17][1]="*...*";
    alphabest[17][2]="*...*";
    alphabest[17][3]="****.";
    alphabest[17][4]="*.*..";
    alphabest[17][5]="*..*.";
    alphabest[17][6]="*...*";

    alphabest[18][0]=".****";
    alphabest[18][1]="*....";
    alphabest[18][2]="*....";
    alphabest[18][3]=".***.";
    alphabest[18][4]="....*";
    alphabest[18][5]="....*";
    alphabest[18][6]="****.";

    alphabest[19][0]="*****";
    alphabest[19][1]="..*..";
    alphabest[19][2]="..*..";
    alphabest[19][3]="..*..";
    alphabest[19][4]="..*..";
    alphabest[19][5]="..*..";
    alphabest[19][6]="..*..";

    alphabest[20][0]="*...*";
    alphabest[20][1]="*...*";
    alphabest[20][2]="*...*";
    alphabest[20][3]="*...*";
    alphabest[20][4]="*...*";
    alphabest[20][5]="*...*";
    alphabest[20][6]=".***.";

    alphabest[21][0]="*...*";
    alphabest[21][1]="*...*";
    alphabest[21][2]="*...*";
    alphabest[21][3]="*...*";
    alphabest[21][4]=".*.*.";
    alphabest[21][5]=".*.*.";
    alphabest[21][6]="..*..";

    alphabest[22][0]="*...*";
    alphabest[22][1]="*...*";
    alphabest[22][2]="*...*";
    alphabest[22][3]="*.*.*";
    alphabest[22][4]="*.*.*";
    alphabest[22][5]="*.*.*";
    alphabest[22][6]=".*.*.";

    alphabest[23][0]="*...*";
    alphabest[23][1]="*...*";
    alphabest[23][2]=".*.*.";
    alphabest[23][3]="..*..";
    alphabest[23][4]=".*.*.";
    alphabest[23][5]="*...*";
    alphabest[23][6]="*...*";

    alphabest[24][0]="*...*";
    alphabest[24][1]="*...*";
    alphabest[24][2]=".*.*.";
    alphabest[24][3]="..*..";
    alphabest[24][4]="..*..";
    alphabest[24][5]="..*..";
    alphabest[24][6]="..*..";

    alphabest[25][0]="*****";
    alphabest[25][1]="....*";
    alphabest[25][2]="...*.";
    alphabest[25][3]="..*..";
    alphabest[25][4]=".*...";
    alphabest[25][5]="*....";
    alphabest[25][6]="*****";

    for(int i=0; i<7; i++)
    {
        cin>>input[i];
    }
    for(int i=0; i<input[0].length(); i+=6)
    {
        for(int j=0; j<7; j++)
        {
            for(int k=0; k<5; k++)
            {
                words[j]+=input[j][k+i];
            }

        }
        comp();
        for(int j=0;j<7;j++)
            words[j].clear();
    }

   cout<<endl;



























    return 0;
}