#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA

const int L = 38;

vector<vector<int>> T;

void _Paint(int a, int b, int c) {
    a = (a % 8 + 8) % 8, b = (b % 8 + 8) % 8;
    if (T[a][b] == -1) Paint(a, b, (T[a][b] = c));
}

void preprocess(int X, int Y) {
    for (int r = 0; r < 8; ++r) T[r][Y] = 2;
    for (int c = 0; c < 8; ++c) T[X][c] = 2;
    
    auto [sx, dx] = ((X >> 2 & 1) ? pair{0, 1} : pair{7, -1});
    auto [sy, dy] = ((Y >> 2 & 1) ? pair{0, 1} : pair{7, -1});
    int ex = (X == 0 or X == 7), ey = (Y == 0 or Y == 7);
    
    _Paint(sx,    sy, 1), _Paint(sx,    sy+dy, 1);
    _Paint(sx+dx, sy, 1), _Paint(sx+dx, sy+dy, 1);
    _Paint(sx,    sy+2*dy, (X >> 1 & 1)), _Paint(sx,    sy+3*dy, (X >> 0 & 1));
    _Paint(sx+dx, sy+2*dy, (Y >> 1 & 1)), _Paint(sx+dx, sy+3*dy, (Y >> 0 & 1));
    _Paint(sx, 7-sy-dy*ey, 0), _Paint(7-sx-dx*ex, sy, 0), _Paint(7-sx-dx*ex, 7-sy-dy*ey, 0);
}

// #ifndef local
} /// end of unnamed namespace
// #endif

/// Paint(int a, int b, int c);

void Anna(int X, int Y, int N, string S) {
    T.assign(8, vector<int>(8, -1));
    
    if (N > L) {
        for (int r = 0; r < 8; ++r) for (int c = 0; c < 8; ++c) {
            if (r != X and c != Y) Paint(r, c, 0);
        }
        return;
    }
    S.resize(L, 'A');
    
    preprocess(X, Y);
    
    int tok = 0;
    for (int r = 0; r < 8; ++r) {
        for (int c = 0; c < 8; ++c) {
            if (T[r][c] != -1) continue;
            _Paint(r, c, S[tok++] - 'A');
        }
    }
}

#else

#ifdef local
#include "_A/Anna.h"
#else
#include "Anna.h"
#endif
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

// #ifndef local
namespace {
// #endif

// #define int int64_t
#define double __float80
using pii = pair<int, int>;
template <typename T> using Prior = std::priority_queue<T>;
template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>;

// #define X first
// #define Y second
#define eb emplace_back
#define ef emplace_front
#define ee emplace
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())

#ifdef local
#define fastIO() void()
#define debug(...) \
    fprintf(stderr, "\u001b[33mAt [%s], line %d: (%s) = ", __FUNCTION__, __LINE__, #__VA_ARGS__), \
    _do(__VA_ARGS__), fprintf(stderr, "\u001b[0m")
template <typename T> void _do(T &&_t) {cerr << _t << "\n";}
template <typename T, typename ...U> void _do(T &&_t, U &&..._u) {cerr << _t << ", ", _do(_u...);}
#else
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define debug(...) void()
#endif

template <typename T, typename U> bool chmin(T &lhs, U rhs) {return lhs > rhs ? lhs = rhs, 1 : 0;}
template <typename T, typename U> bool chmax(T &lhs, U rhs) {return lhs < rhs ? lhs = rhs, 1 : 0;}

#endif

#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA

const int L = 38;

vector<vector<int>> D;

void _Paint(int a, int b, int c) {
    a = (a % 8 + 8) % 8, b = (b % 8 + 8) % 8;
    if (D[a][b] == -1) D[a][b] = c;
}

void preprocess(int X, int Y) {
    for (int r = 0; r < 8; ++r) D[r][Y] = 2;
    for (int c = 0; c < 8; ++c) D[X][c] = 2;
    
    auto [sx, dx] = ((X >> 2 & 1) ? pair{0, 1} : pair{7, -1});
    auto [sy, dy] = ((Y >> 2 & 1) ? pair{0, 1} : pair{7, -1});
    int ex = (X == 0 or X == 7), ey = (Y == 0 or Y == 7);
    
    _Paint(sx,    sy, 1), _Paint(sx,    sy+dy, 1);
    _Paint(sx+dx, sy, 1), _Paint(sx+dx, sy+dy, 1);
    _Paint(sx,    sy+2*dy, (X >> 1 & 1)), _Paint(sx,    sy+3*dy, (X >> 0 & 1));
    _Paint(sx+dx, sy+2*dy, (Y >> 1 & 1)), _Paint(sx+dx, sy+3*dy, (Y >> 0 & 1));
    _Paint(sx, 7-sy-dy*ey, 0), _Paint(7-sx-dx*ex, sy, 0), _Paint(7-sx-dx*ex, 7-sy-dy*ey, 0);
}

// #ifndef local
} /// end of unnamed namespace
// #endif

string Bruno(int N, vector<vector<int>> T) {
    D.assign(8, vector<int>(8, -1));
    
    if (N > L) return string(N, 'A');
    
    int X = -1, Y = -1;
    if ((T[0][0] & T[0][1] & T[1][0] & T[1][1]) == 1) {
        X = (1 << 2) | (T[0][2] << 1) | (T[0][3] << 0);
        Y = (1 << 2) | (T[1][2] << 1) | (T[1][3] << 0);
    }
    if ((T[0][7] & T[0][6] & T[1][7] & T[1][6]) == 1) {
        X = (1 << 2) | (T[0][5] << 1) | (T[0][4] << 0);
        Y = (0 << 2) | (T[1][5] << 1) | (T[1][4] << 0);
    }
    if ((T[7][0] & T[7][1] & T[6][0] & T[6][1]) == 1) {
        X = (0 << 2) | (T[7][2] << 1) | (T[7][3] << 0);
        Y = (1 << 2) | (T[6][2] << 1) | (T[6][3] << 0);
    }
    if ((T[7][7] & T[7][6] & T[6][7] & T[6][6]) == 1) {
        X = (0 << 2) | (T[7][5] << 1) | (T[7][4] << 0);
        Y = (0 << 2) | (T[6][5] << 1) | (T[6][4] << 0);
    }
    // debug(X, Y);
    preprocess(X, Y);
    
    string ans;
    for (int r = 0; r < 8; ++r) {
        for (int c = 0; c < 8; ++c) {
            if (D[r][c] != -1) continue;
            ans += (T[r][c] == 0 ? "A" : "B");
        }
    }
    ans.resize(N);
    return ans;
}

#else

#ifdef local
#include "_A/Bruno.h"
#else
#include "Bruno.h"
#endif
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;

// #ifndef local
namespace {
// #endif

// #define int int64_t
#define double __float80
using pii = pair<int, int>;
template <typename T> using Prior = std::priority_queue<T>;
template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>;

// #define X first
// #define Y second
#define eb emplace_back
#define ef emplace_front
#define ee emplace
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())

#ifdef local
#define fastIO() void()
#define debug(...) \
    fprintf(stderr, "\u001b[33mAt [%s], line %d: (%s) = ", __FUNCTION__, __LINE__, #__VA_ARGS__), \
    _do(__VA_ARGS__), fprintf(stderr, "\u001b[0m")
template <typename T> void _do(T &&_t) {cerr << _t << "\n";}
template <typename T, typename ...U> void _do(T &&_t, U &&..._u) {cerr << _t << ", ", _do(_u...);}
#else
#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define debug(...) void()
#endif

template <typename T, typename U> bool chmin(T &lhs, U rhs) {return lhs > rhs ? lhs = rhs, 1 : 0;}
template <typename T, typename U> bool chmax(T &lhs, U rhs) {return lhs < rhs ? lhs = rhs, 1 : 0;}

#endif