#include <bits/stdc++.h>

using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
using ll = int;
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()

vii edge, weight;
vector<bool> visited, used;
vector<string> ans;
ll N;
vi mem;

void 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(now == (2<<N) || next == (2<<N)) continue;
        ll l = now/2, r = next/2;
        ll idx = mem[l^r];
        ll bit = (l&((1<<(idx))-1))+(l>>(idx+1)<<idx);
        if(now%2){
            ans[N-1-idx][bit] = 'B';
        }
        else{
            ans[N-1-idx][bit] = 'C';
        }
    }
};

int main(){
    cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    cin >> N;
    mem.resize(1<<N);
    rep(i,0,N) mem[1<<i] = i;
    edge.resize((2<<N)+1), weight.resize((2<<N)+1);
    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);
                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++;
        }
    }
    ans.resize(N, string(1<<(N-1),'A'));
    used.resize(M);
    visited.resize((2<<N)+1);

    REP(i,0,2<<N){
        if(visited[i]) continue;
        dfs(i);
    }
    rep(i,0,N){
        cout << ans[i] << ln;
    }
}