#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
   
   char C[3] = { 'A', 'B', 'C' };
    int HA,HB,HC,WA,WB,WC;
    cin >> HA >> WA >> HB >> WB >> HC >> WC;
    
    vector< pair<int,int> > P;
    P.push_back( make_pair(HA*1000 - WA, 0) );
    P.push_back( make_pair(HB*1000 - WB, 1) );
    P.push_back( make_pair(HC*1000 - WC, 2) );
    sort( P.begin(), P.end(), greater< pair<int,int> >() );
    
    for ( int i = 0;  i < 3; i++ ) {
        cout << C[P[i].second] << endl;
    }
    
   
    return 0;
}