#include <bits/stdc++.h>
using namespace std;

#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
typedef pair<ll, ll> P;
using tp = tuple<ll, ll, ll>;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll)1e9 + 7;
//constexpr long long MOD = 998244353LL;
using ld = long double;
static const ld pi = 3.141592653589793L;
typedef vector<ll> Array;
typedef vector<Array> Matrix;

template <class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

//グラフ関連
struct Edge {
    ll to, cap, rev;
    Edge(ll _to, ll _cap, ll _rev) {
        to = _to;
        cap = _cap;
        rev = _rev;
    }
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;

void add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag, ll revCap) {
    G[from].push_back(Edge(to, cap, (ll)G[to].size()));
    if(revFlag)
        G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}

void solve() {
    ll n;
    cin >> n;
    if(n == 2) {
        cout << -1 << en;
    } else if(n == 3) {
        cout << "aa." << en;
        cout << "..b" << en;
        cout << "..b" << en;
    } else {
        vec<string> ans(n, string(n, '.'));
        vec<string> a4({"aabc", "ccbc", "abaa", "abcc"});
        vec<string> a5({"aabbc", "bcc.c", "b..cd", "c..cd", "cbbaa"});
        vec<string> a6({"aacd..", "bbcd..", "..aacd", "..bbcd", "cd..aa", "cd..bb"});
        vec<string> a7({"aabbcc.", "bb.aa.c", "..b..ac", "..b..ab", "aa.bb.b", "..a..bc", "..a..bc"});

        if(n % 4 == 0) {
            ll x = n / 4;
            REP(i, x) {
                REP(j, 4) {
                    REP(k, 4) {
                        ans[i * 4 + j][i * 4 + k] = a4[j][k];
                    }
                }
            }
        } else if(n % 4 == 1) {
            ll x = n / 4 - 1;
            REP(i, x) {
                REP(j, 4) {
                    REP(k, 4) {
                        ans[i * 4 + j][i * 4 + k] = a4[j][k];
                    }
                }
            }
            REP(j, 5) {
                REP(k, 5) {
                    ans[x * 4 + j][x * 4 + k] = a5[j][k];
                }
            }
        } else if(n % 4 == 2) {
            ll x = n / 4 - 1;
            REP(i, x) {
                REP(j, 4) {
                    REP(k, 4) {
                        ans[i * 4 + j][i * 4 + k] = a4[j][k];
                    }
                }
            }
            REP(j, 6) {
                REP(k, 6) {
                    ans[x * 4 + j][x * 4 + k] = a6[j][k];
                }
            }
        } else if(n % 4 == 3) {
            ll x = n / 4 - 1;
            REP(i, x) {
                REP(j, 4) {
                    REP(k, 4) {
                        ans[i * 4 + j][i * 4 + k] = a4[j][k];
                    }
                }
            }
            REP(j, 7) {
                REP(k, 7) {
                    ans[x * 4 + j][x * 4 + k] = a7[j][k];
                }
            }
        }
        REP(i, n) {
            cout << ans[i] << en;
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    /*
    ll t;
    cin >> t;
    while(t--)*/
    solve();

    return 0;
}


Measured memory_bytes: 4624