#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)

mt19937 gen(114514);

int main(void)
{
	int n;
	scanf("%d",&n);
	
	vector< vector<int> > a(n, vector<int>(1 << (n-1)));
	
	auto check = [&] (void) -> bool
	{
		for(int mask=0; mask<(1<<n); ++mask)
		{
			int cnt[2] = {0,0};
			int ok[2] = {0,0};
			for(int i=0; i<n; ++i)
			{
				int cur = 0;
				for(int j=0; j<n; ++j) if(i != j)
					cur = cur << 1 | bdig(mask, j);
				
				int x = bdig(mask, i);
				int y = a[i][cur];
				
				++cnt[x];
				ok[x] += x == y;
			}
			
			if(ok[0] < cnt[0] / 2) return 0;
			if(ok[1] < cnt[1] / 2) return 0;
		}
		return 1;
	};
	
	do
	{
		for(auto &t: a)
			for(auto &tt: t)
				tt = gen() % 2;
	}while(!check());
	
	for(int i=0; i<n; ++i)
	{
		for(int j=0; j<(1<<(n-1)); ++j)
			putchar(a[i][j] + 'B');
		printf("\n");
	}
	return 0;
}