#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using mint = modint998244353;
#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}

const ll inf=1000000000000000000;
const ll mod=998244353;
const double pi=acos(-1);

ll root(ll x){
    ll k=(ll)sqrt(x);
    while(k*k>x) k--;
    while((k+1)*(k+1)<=x) k++;
    return k;
}

//logN
void press(vector<ll> &a){
    map<ll,ll> ord;
    for(auto x:a) ord[x]=1;
    ll j=0;
    for(auto &p:ord){
        p.second=j;
        j++;
    }
    for(auto &x:a) x=ord[x];
    return;
}

mint kaijou(ll n){
    mint a=1;
    rep(i,n){
        a*=(i+1);
    }
    return a;
}

vector<vector<mint>> matmul(vector<vector<mint>> &a,vector<vector<mint>> &b){
    vector<vector<mint>> ret(a.size(),vector<mint>(b[0].size()));
    rep(i,a.size()) rep(j,b[0].size()) rep(k,b.size()) ret[i][j]+=a[i][k]*b[k][j];
    return ret;
}

vector<vector<mint>> matpow(vector<vector<mint>> a,ll n){
    ll siz=a.size();
    vector<vector<mint>> ret(siz,vector<mint>(siz));
    while(n>0){
        if(n&1) ret=matmul(a,ret);
        rep(i,siz) ret[i][i]=1;
        a=matmul(a,a);
        n=n/2;
    }
    return ret;
}

int main () {
    ll n;
    cin>>n;
    if(n<=2){
        cout<<-1<<endl;
        return 0;
    }
    if(n==3){
        cout<<"ABBBAA"<<endl<<"ABBBBA"<<endl<<"ABBBBA"<<endl;
        cout<<"ABBBBA"<<endl<<"ABBBAA"<<endl<<"AAAAAA"<<endl;
        return 0;
    }
    if(n==4){
        vector<string> a(8);
        a[0]="ABBBBAAA";
        a[1]="ABBBBBBA";
        a[2]="ABBBBBBA";
        a[3]="ABBBBBBA";
        a[4]="ABBBBBBA";
        a[5]="ABBBBAAA";
        a[6]="AAAAAAAA";
        a[7]="AAAAAAAA";
        rep(i,8) cout<<a[i]<<endl;
        return 0; 
    }
    vector<vector<char>> ans(n*2,vector<char>(n*2));
    ans[0][0]='B';
    ans[0][1]='B';
    ans[1][0]='B';
    ans[1][1]='B';
    rep(i,n*2-4) ans[2+i][1]='B';
    rep(i,n*2-4) ans[1][2+i]='B';
    ll cnt=n*4-4;
    rep(i,n*2-4) rep(j,n*2-4){
        if(cnt<n*n*2){
            ans[2+i][2+j]='B';
            cnt++;
        }
    }
    rep(i,n*2) rep(j,n*2) if(ans[i][j]!='B') ans[i][j]='A';
    rep(i,n*2) {
        rep(j,n*2) cout<<ans[i][j];
        cout<<endl;
    }
}