#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;

/*
RR WR
RW RR
WR WW
WW RW
*/

int main(){
    cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    ll N; cin >> N;
    vector<string> S(N);
    rep(i,0,(1<<(N-1))){
        vi cnt(2);
        ll right = N-1;
        if(right%2 == 0) right--;
        rep(j,0,right){
            if(i & (1ll<<j)) cnt[1]++;
            else cnt[0]++;
        }
        rep(j,0,N){
            if(j%2){
                if(cnt[0] > cnt[1]) S[j] += 'C';
                else S[j] += 'B';
            }
            else{
                if(cnt[0] > cnt[1]) S[j] += 'B';
                else S[j] += 'C';
            }
        }
    }
reverse(all(S));
    rep(i,0,N) cout << S[i] << ln;
}