#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<array>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
inline int bit(int x){return 1<<x;}
int n;
int d[(1<<18)*2+10],et;
vpii eg[(1<<18)*2+10];
int vis[4000010],head[(1<<18)*2+10];
void adde(int S,int T){
	++d[S];++d[T];++et;
	eg[S].pb(T,et);eg[T].pb(S,et);
}
int U;
void dfs(int x){
	for(int &i=head[x];i<(int)eg[x].size();i++){
		int v=eg[x][i].fi,id=eg[x][i].se;
		if(!vis[id]){
			vis[id]=1;
			if(x!=U&&v!=U){
				int p=x,q=v;
				if(p>=bit(n))p-=bit(n);
				if(q>=bit(n))q-=bit(n);
				int t=(p^q);
				if(p&t)vis[id]=1;
				else vis[id]=2;
			}
			dfs(v);
		}
	}
}
int ca(int S,int k){
	return (S&(bit(k-1)-1))|((S>>k)<<(k-1));
}
int a[19][(1<<18)+10];
signed main(){
//	#ifdef do_while_true
//		assert(freopen("hat.in","r",stdin));
//		assert(freopen("hat.out","w",stdout));
//	#endif
	read(n);
	for(int S=0;S<bit(n);S++){
		for(int i=1;i<=n;i++)if(bit(i-1)&S){
			int T=S^bit(i-1);
			adde(S,T+bit(n));
		}
	}
	U=2*bit(n);
	for(int i=0;i<bit(n);i++){
		if(d[i]&1)adde(U,i);
		if(d[i+bit(n)]&1)adde(U,i+bit(n));
	}
	for(int i=0;i<=2*bit(n);i++)dfs(i);
	int tot=0;
	for(int S=0;S<bit(n);S++){
		for(int i=1;i<=n;i++)if(bit(i-1)&S){
			++tot;
			a[i][ca(S,i)]=vis[tot];
		}
	}
	for(int i=1;i<=n;i++,puts(""))
		for(int j=0;j<bit(n-1);j++)
			putchar('A'+a[n-i+1][j]);
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}