#include <cstdio>
#include <algorithm>

constexpr int MAXN = 18;
constexpr int MAXV = 1 << MAXN;
constexpr int MAXM = (MAXN + 1) * MAXV >> 1 | 1;

class Edge {
public:
    int v, nxt;
} e[MAXM << 1];

int eCnt = 1, len = 0, h[MAXV], cur[MAXV], euler[MAXM], id[MAXV];

bool vis[MAXM << 1];

char ans[MAXN][MAXV];

void addEdge(int u, int v) {
    e[++ eCnt] = {v, h[u]};
    h[u] = eCnt;
    e[++ eCnt] = {u, h[v]};
    h[v] = eCnt;
}

void solve(int u) {
    for (int &i = cur[u]; i;) {
        int v = e[i].v, j = i;
        i = e[i].nxt;

        if (!vis[j]) {
            vis[j] = vis[j ^ 1] = true;
            solve(v);
        }
    }

    euler[len ++] = u;
}

int main() {
    int n;
    scanf("%d", &n);

    for (int st = 0; st < 1 << n; st ++) {
        for (int i = 0; i < n; i ++) {
            if (!(st >> i & 1)) {
                addEdge(st, (st ^ 1 << i) | 1 << n);
            }
        }
    }

    int all = (1 << n) - 1;
    for (int st = 0; st < 1 << n; st ++) {
        if (__builtin_popcount(all ^ st) & 1) {
            addEdge(st, (all ^ st) | 1 << n);
        }
    }

    for (int i = 0; i < n; i ++) {
        id[1 << i] = i;
    }
    for (int st = 0; st < 1 << (n + 1); st ++) {
        cur[st] = h[st];
    }
    for (int st = 0; st < 1 << (n + 1); st ++) {
        if (!cur[st]) {
            continue;
        }
        len = 0;
        solve(st);

        for (int i = 1; i < len; i ++) {
            int st = (euler[i] ^ euler[i - 1]) & all;
            if (st == all) {
                continue;
            }

            int u = id[st], tmp = (1 << u) - 1, ed = euler[i];
            ans[u][(all >> 1) ^ ((ed & all) >> (u + 1) << u | (ed & tmp))] = 'B' ^ (bool){ed >> n};
        }
    }

    std::reverse(ans, ans + n);

    for (int i = 0; i < n; i ++) {
        std::reverse(ans[i], ans[i] + (1 << (n - 1)));
        printf("%s\n", ans[i]);
    }

    return 0;
}