//translated from Izborne Pripreme 2022 (Croatian IOI/CEOI Team Selection) D1T3. 3s,0.5G
//like little circle!
//ad-hoc
//little circle loves Eulerian circuit
#include <bits/stdc++.h>
#define il inline
using namespace std;
const int N=(1<<23),M=(1<<19)+5;
int n,S,fi[N],in[M];
bitset<N> vis,c;
int head[M],tot=1;
struct node{
    int to,nxt;
    il node(){to=nxt=0;}
}e[N];
il void add(int x,int y){e[++tot].to=y,e[tot].nxt=head[x],head[x]=tot;}
il void adde(int x,int y){add(x,y),add(y,x);}
void dfs(int x){
    int y;
    for(int &i=head[x];i;i=e[i].nxt){
        y=e[i].to;
        if(!vis[i>>1]) vis[i>>1]=1,c[i>>1]=(x>=S),dfs(y);
    }
}
int x,y,z,u,v,w;
int main(){
    scanf("%d",&n);S=(1<<n);
    for(int i=0;i<n;++i){
        for(int j=0;j<(S>>1);++j){
            x=(j&((1<<i)-1)),y=(j^x),z=(y<<1)+x;
            u=z,v=(z|(1<<i))+S,adde(u,v),++in[u],++in[v];
        }
    }
    for(int i=0;i<(S<<1);++i) if(in[i]&1) adde(S<<1,i);
    for(int i=0;i<=(S<<1);++i) dfs(i);
    for(int i=0;i<n;++i){
        for(int j=0;j<(S>>1);++j)putchar('B'+c[++w]);
        puts("");
    }
    return 0;
}