#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


constexpr int MAX_N = 18;

int N;

// popcnt K <-> K+1
int K;
inline int side(int u) {
  return __builtin_popcount(u) - K;
}

int deg[1 << MAX_N];
bool dir[1 << MAX_N][MAX_N];

void dfs(int u) {
  const int s = side(u);
  assert(s == 0 || s == 1);
  for (int i = 0; i < N; ++i) if ((u >> i & 1) == s) {
    const int v = u ^ 1 << i;
    if (!dir[u][i] && !dir[v][i]) {
      --deg[u];
      --deg[v];
      dir[u][i] = true;
      dfs(v);
    }
  }
}

int main() {
  for (; ~scanf("%d", &N); ) {
    fill(deg, deg + (1 << N), 0);
    memset(dir, 0, sizeof(dir));
    for (K = 0; K < N; ++K) {
      for (int u = 0; u < 1 << N; ++u) {
        const int s = side(u);
        if (s == 0) deg[u] = N - K;
        if (s == 1) deg[u] = K + 1;
      }
      for (int u = 0; u < 1 << N; ++u) {
        for (; deg[u] & 1; ) {
          dfs(u);
        }
      }
      for (int u = 0; u < 1 << N; ++u) {
        for (; deg[u] > 0; ) {
          dfs(u);
        }
      }
    }
    
    for (int i = 0; i < N; ++i) {
      for (int p = 0; p < 1 << (N-1); ++p) {
        int u = 0;
        for (int j = 0; j < N - 1; ++j) {
          u |= (p >> ((N-1)-1-j) & 1) << ((j < i) ? j : (j + 1));
        }
        putchar(dir[u][i] ? 'B' : dir[u | 1 << i][i] ? 'C' : '?');
      }
      puts("");
    }
  }
  return 0;
}