#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cstdio>


using namespace std;
#define MAXN 27

int niz1[MAXN];
int niz2[MAXN];
char slov[MAXN] ;
int max1=-1,max2=-1;
int main ( void ) {
    for ( int i = 0 ; i < 26 ; ++ i ){
    scanf ("%d",& niz1[i]);
    niz1[i]=niz2[i];

    }
    sort (niz1, niz1 + 26 ) ;

    for ( int j = 0 ; j < 26 ; ++ j ) {
        if ( niz2[j] == niz1[24] || niz2[j]== niz1[25] ){
        cout<<(char)( j + 65) ;
        niz2[j] = -1;
                     }
        else continue;
        }





    system("PAUSE");
    return 0 ;
    }