#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int ALL = (1<<19) + 5;
const int MAXE = ALL * 18;

#define bbit(i) (1<<(i))
#define bdig(x,i) (((x)>>(i))&1)

struct Edge
{
	int next,to,res;
}e[MAXE];
int head[ALL], etot = -1;
inline void add_one(int u,int v)
{
	e[++etot] = (Edge){ head[u],v,-1};
	head[u] = etot;
}
inline void add_edge(int u,int v)
{
	add_one(u,v); add_one(v,u);
}

int id[ALL][18];

int cur[ALL];
bool vis[ALL];

void dfs(int u)
{
	vis[u] = 1;
	for(int &i=cur[u]; ~i; i=e[i].next)
	{
		if(e[i].res != -1) continue;
		int v = e[i].to;
		e[i].res = 1;
		e[i^1].res = 0;
		dfs(v);
	}
}

int main(void)
{
	int n;
	scanf("%d",&n);
	
	int pcnt = (1<<n) * 2 + 1;
	
	memset(head, -1, sizeof(head));
	for(int i=0; i<(1<<n); ++i)
	{
		int cnt[2] = {0,0};
		for(int k=0; k<n; ++k)
		{
			int x = bdig(i, k);
			++cnt[x];
			if(x == 1) continue;
			
			int j = i ^ bbit(k);
			id[i][k] = etot + 1;
			add_edge(i << 1 | 0, j << 1 | 1);
		}
		if(cnt[0] & 1)
			add_edge(i << 1 | 0, pcnt - 1);
		if(cnt[1] & 1)
			add_edge(i << 1 | 1, pcnt - 1);
	}
	
	memcpy(cur, head, sizeof(head));
	for(int i=0; i<pcnt; ++i) if(!vis[i])
		dfs(i);
	
	static int ans[18][ALL];
	for(int i=0; i<(1<<n); ++i)
		for(int k=0; k<n; ++k) if(!bdig(i, k))
		{
			int mask = 0;
			for(int kk=0; kk<n; ++kk) if(kk != k)
				mask = mask << 1 | bdig(i, kk);
			ans[k][mask] = e[id[i][k]].res;
		}
	
	for(int i=0; i<n; ++i, printf("\n"))
		for(int j=0; j<(1<<(n-1)); ++j)
			putchar(ans[i][j] + 'B');
	return 0;
}