#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <vector>
#include <cstring>
using namespace std;
map<int, string> poss;
int encode(string s)
{
    int k = 1000000*((int)s[0]) + 10000*((int)s[1]) + 100*((int)s[2]) + (int)s[3], m = 11*(int)s[0] + 101*(int)s[1] + 1009*(int)s[2] + 10007*(int)s[3];
    return (k%m);
}
void perm(int d, string s)
{
    if (d == 4)
    {
        poss[encode(s)] = s;
    }
    else
    {
        for (int i = 1; i < 27; i++)
        {
            string t = s + char(i + 64);
            perm(d + 1, t);
        }
    }
}
int main()
{
    freopen("DATA5.txt", "r", stdin);
    freopen("OUT5.txt", "w", stdout);
    perm(0, "");
    for (int i = 0; i < 5; i++)
    {
        int n;
        cin >> n;
        cout << poss.find(n) -> second << endl;
    }
    return 0;
}