#include<bits/stdc++.h>
#define ls (p<<1)
#define rs (p<<1|1)
#define se second
#define fi first
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pil=pair<int,ll>;
using pli=pair<ll,int>;
using pll=pair<ll,ll>;
using i128=__int128_t;
const int N=2e5+3,P=998244353;
// const ll INF=0x3f3f3f3f3f3f3f3f;
const int INF=0x3f3f3f3f;
template<class T1,class T2>void ckmn(T1 &x,T2 y){if(x>y)x=y;}
template<class T1,class T2>void ckmx(T1 &x,T2 y){if(x<y)x=y;}
template<class T1,class T2>void add(T1 &x,T2 y){if((x+=y)>=P)x-=P;}
template<class T1,class T2>void dlt(T1 &x,T2 y){if((x-=y)<0)x+=P;}
ll fp(ll a,ll b=P-2){ll ans=1;for(;b;b>>=1,a=a*a%P)if(b&1)ans=ans*a%P;return ans;}
int n;

int main(){
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    int u,v,w,x,y,z;
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n;
    int s=n&1?0x5555555:0xaaaaaaaa;
    for(int i=0;i<n;++i,puts(""))
        for(int j=0;j<1<<n-1;++j)
            printf("%c","BC"[__builtin_parity(j&s)^(i&1)]);           
    return 0;
}