#include <bits/stdc++.h>

using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
using ll = long long;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll,ll>;

#define rep(i,j,k) for(ll i=ll(j); i<ll(k); i++)
#define REP(i,j,k) for(ll i=ll(j); i<=ll(k); i++)
#define per(i,j,k) for(ll i=ll(j); i>=ll(k); i--)
#define ln "\n"
#define pb emplace_back
#define mp std::make_pair
#define mtp std::make_tuple
#define all(a) a.begin(),a.end()

constexpr ll inf = 1e18;

int main(){
    cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    ll N; cin >> N;
    vii edge((2<<N)+1), weight((2<<N)+1);
    vi idx, bit;
    ll M = 0;
    rep(i,0,1<<N){
        rep(j,0,N){
            if(i & (1<<j)){
                ll now = i;
                ll next = i^(1<<j);
                edge[now*2].pb(next*2+1);
                weight[now*2].pb(M);
                edge[next*2+1].pb(now*2);
                weight[next*2+1].pb(M);
                ll val = 0;
                val += (i&((1<<j)-1));
                val += ((i>>(j+1))<<j);
                assert(0 <= val && val < ((1<<(N-1))));
                idx.pb(j);
                bit.pb(val);
                M++;
            }
        }
    }
    rep(i,0,2<<N){
        if(edge[i].size()%2){
            edge[i].pb((2<<N));
            weight[i].pb(M);
            edge[(2<<N)].pb(i);
            weight[(2<<N)].pb(M);
            M++;
        }
    }
    assert(edge[2<<N].size()%2 == 0);
    vector<string> ans(N, string(1<<(N-1),'A'));
    vector<bool> used(M);
    vector<bool> visited((2<<N)+1);
    std::function<void(ll)> dfs = [&](ll now){
        visited[now] = true;
        rep(i,0,edge[now].size()){
            ll next = edge[now][i];
            ll m = weight[now][i];
            if(used[m]) continue;
            used[m] = true;
            dfs(next);
            if(m >= idx.size()) continue;
            if(now%2){
                assert(next%2 == 0);
                ans[idx[m]][bit[m]] = 'B';
            }
            else{
                assert(next%2);
                ans[idx[m]][bit[m]] = 'C';
            }
        }
    };
    REP(i,0,2<<N){
        if(visited[i]) continue;
        dfs(i);
    }
    rep(i,0,1<<N){
        vi sum(2), ok(2);
        rep(j,0,N){
            ll val = 0;
            val += (i&((1<<j)-1));
            val += ((i>>(j+1))<<j);
            if(i&(1<<j)){
                sum[1]++;
                if(ans[j][val] == 'C') ok[1]++;
            }
            else{
                sum[0]++;
                if(ans[j][val] == 'B') ok[0]++;
            }
        }
    }
    rep(i,0,N){
        reverse(all(ans[i]));
        cout << ans[i] << ln;
    }
}