#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A& a, const B& b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A& a, const B& b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	n *= 2;
	vector<string>s(n);
	rep(i, n)s[i] = string(n, 'A');
	if (n <= 4) {
		cout << -1 << endl;
	}
	else if (n == 6) {
		s[1] = s[5] = "ABBBAA";
		s[2] = s[3] = s[4] = "ABBBBA";
	}
	else if (n == 8) {
		s[2] = s[7] = "AABBBBAA";
		s[3] = s[4] = s[5] = s[6] = "ABBBBBBA";
	}
	else {
		s[0][0] = s[0][1] = s[1][0] = 'B';
		rep(i, n - 3)rep(j, n - 3)s[i + 1][j + 1] = 'B';
		int d = n * n / 2 - 6 * n + 12;
		rrep2(i, 1, n - 2) {
			int x = min(n - 4, d);
			d -= x;
			rep(j, x)s[i][n - 3 - j] = 'A';
		}
	}
	rep(i, n)cout << s[i] << endl;
	return 0;
}