#include <cstdio>
using namespace std;
int read(){
	char c=getchar();int x=0;
	while(c<48||c>57) c=getchar();
	do x=(x<<1)+(x<<3)+(c^48),c=getchar();
	while(c>=48&&c<=57);
	return x;
}
const int N=(1<<19)|3,M=5000003;
int hd[N],ver[M],nxt[M],tot=1;
int cur[N];
bool del[M];
int n;
int stk[M],tp;
bool deg[N];
void add(int u,int v){
	deg[v]^=1;
	nxt[++tot]=hd[u];hd[u]=tot;ver[tot]=v;
}
void path(int u){
	while(cur[u]&&del[cur[u]>>1]) cur[u]=nxt[cur[u]];
	if(cur[u]){
		del[cur[u]>>1]=1;
		path(ver[cur[u]]);
		stk[++tp]=cur[u]>>1;
		cur[u]=nxt[cur[u]];
	}
	else deg[u]^=1;
	//printf("%d ",u);
}
void dfs(int u){
	for(int i=cur[u];i;i=cur[u]){
		cur[u]=nxt[i];
		if(del[i>>1]) continue;
		del[i>>1]=1;
		dfs(ver[i]);
		stk[++tp]=i>>1;
	}
	//printf("%d ",u);
}
int id[18][1<<17];
bool res[M];
int que[N],tl;
int main(){
	n=read();
	for(int i=0;i<n;++i)
		for(int s=0;s<(1<<(n-1));++s){
			int msk=s&((1<<(n-i-1))-1);
			int u=((s^msk)<<1)|msk;
			int v=u|(1<<(n-i-1))|(1<<n);
			add(u,v);add(v,u);
			id[i][s]=tot>>1;
		}
	for(int i=0;i<(1<<(n+1));++i){
		cur[i]=hd[i];
		if(deg[i]) que[++tl]=i;
	}
	for(int pos=1;pos<=tl;++pos){
		int u=que[pos];
		if(deg[u]){
			deg[u]^=1;
			path(u);
			int par=(u>=(1<<n));
			while(tp){
				res[stk[tp--]]=par;
				par^=1;
			}
		}
	}
	for(int i=0;i<(1<<(n+1));++i){
		dfs(i);
		int par=(i>=(1<<n));
		while(tp){
			res[stk[tp--]]=par;
			par^=1;
		}
	}
	for(int i=0;i<n;++i){
		for(int s=0;s<(1<<(n-1));++s)
			if(res[id[i][s]]) putchar('C');
			else putchar('B');
		putchar('\n');
	}
	return 0;
}