# https://github.com/tyuyu-62/cp-library
from collections import deque, defaultdict
from itertools import permutations, product
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop
from random import randint, shuffle
from time import perf_counter as pc
def II(): return int(input())
def LI(dec=0): return [int(x) - dec for x in input().split()]
def SI(): return input()
def LS(): return list(input().split())
mod = 998244353
inf = 2002002002002002002

import sys
sys.setrecursionlimit(10 ** 6)
input = lambda: sys.stdin.readline().rstrip()
_buf = []
def print(*args, sep=" "): _buf.append(sep.join(map(str, args)))
def debug(*args):
    if DEBUG: sys.stdout.write(" ".join(map(str, args)) + "\n")
DEBUG = True


def solve():
    N = II()
    if N <= 2:
        print(-1)
        return
    A = [["A" for _ in range(2 * N)] for _ in range(2 * N)]
    for i in range(N + (N + 1) // 2):
        for j in range(1, 1 + N + N // 2):
            A[i][j] = "B"
    for i in range((N + 1) // 2):
        for j in range(1, 1 + N // 2):
            A[i][j] = "A"
    for i in range(2 * N):
        print("".join(A[i]))

    return

if __name__ == "__main__":
    T = 1
    # T = II()
    for _ in range(T):
        solve()
    sys.stdout.write("\n".join(_buf) + "\n")