#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

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

int getdel(int mask,int i)
{
	int t = mask >> (i+1);
	return mask ^ (t << (i+1)) ^ (t << i);
}

vector< vector<int> > getres(int n)
{
	if(n == 2) return {{0,1}, {1,0}};
	
	auto a = getres(n - 2);
	vector< vector<int> > res(n, vector<int>(1 << (n-1)));
	
	for(int i=0; i<n-2; ++i)
		for(int mask=0; mask<(1<<(n-1)); ++mask)
		{
			res[i][mask] = a[i][mask & (bbit(n-3) - 1)];
			if(bdig(mask,n-3) != bdig(mask,n-2) && bdig(mask,n-2) == 0)
				res[i][mask] ^= 1;
		}
	
	for(int mask=0; mask<(1<<(n-1)); ++mask)
	{
		int cnt = 0, ok = 0;
		for(int i=0; i<n-2; ++i)
			if(bdig(mask, i) == 0)
			{
				++cnt;
				int tmask = mask & (bbit(n-2) - 1);
				if(a[i][getdel(tmask, i)] == 0)
					++ok;
			}
		
		int flag = cnt % 2 == 1 && ok == cnt / 2;
		
		res[n-2][mask] = bdig(mask,n-2) ^ flag;
		res[n-1][mask] = bdig(mask,n-2) ^ 1 ^ flag;
	}
	
	return res;
}

int main(void)
{
	int n;
	scanf("%d",&n);
	
	auto ans = getres(n);
	reverse(ans.begin(), ans.end());
	
	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;
}