#include <bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i++)
#define per(i, r, l) for(int i = (r); i >= (l); i--)
#define mem(a, b) memset(a, b, sizeof a)
#define For(i, l, r) for(int i = (l), i##e = (r); i < i##e; i++)
#define pb push_back
#define eb emplace_back
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()

using namespace std;
using ll = long long;

template<class T> inline T& cmin(T& a, const T& b) { if(b < a) a = b; return a; }
template<class T> inline T& cmax(T& a, const T& b) { if(a < b) a = b; return a; }
template<class... Args> void print(Args&&... args) {
    ((cout << args << ' '), ...);
}
template<class... Args> void println(Args&&... args) {
    print(args...), cout << endl;
}

bool a[18][1 << 17 | 8];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    For(S, 0, 1 << n - 1) {
        auto g = [&](int i) {
            return S >> i & 1;
        };
        a[0][S] = g(0);
        a[1][S] = !g(0);
        a[2][S] = g(2);
        a[3][S] = !g(2);
        if(g(0) == 0 && g(1) == 1)
            a[2][S] = a[3][S] = 0;
        if(g(0) == 1 && g(1) == 0)
            a[2][S] = a[3][S] = 1;
    }
    For(i, 0, n) {
        For(S, 0, 1 << n - 1)
            cout << "BC"[a[i][S]];
        cout << '\n';
    }
}