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

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int DX[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

long long xor64(long long range) {
    static unsigned long long x = 1145141919810ULL;
    x ^= x << 13;
    x ^= x >> 7;
    return (x ^= x << 17) % range;
}

vector<string> p(int n) {
    while (true) {
        vector<string> ret(n, string(n, '.'));
        bool ng = false;
        rep(i, n) {
            {
                int y, x, cnt = 0;
                do {
                    y = xor64(n), x = xor64(n - 1);
                    cnt++;
                    if (cnt > 100) { break; }
                } while (ret[y][x] != '.' || ret[y][x + 1] != '.');
                if (cnt > 100) { ng = true; }
                ret[y][x] = ret[y][x + 1] = 'a' + i;
            }
            {
                int y, x, cnt = 0;
                do {
                    y = xor64(n - 1), x = xor64(n);
                    cnt++;
                    if (cnt > 100) { break; }
                } while (ret[y][x] != '.' || ret[y + 1][x] != '.');
                if (cnt > 100) { ng = true; }
                ret[y][x] = ret[y + 1][x] = 'a' + n + i;
            }
        }
        rep(i, n) {
            set<char> sty, stx;
            rep(j, n) {
                if (ret[i][j] != '.') { sty.insert(ret[i][j]); }
                if (ret[j][i] != '.') { stx.insert(ret[j][i]); }
            }
            if (sty.size() != 3 || stx.size() != 3) { ng = true; }
        }
        if (ng) { continue; }
        return ret;
    }
}
int N;
signed main() {
    cin >> N;
    if (N == 2) { fin(-1); }
    if (N == 3) {
        cout << "..a" << endl;
        cout << "..a" << endl;
        fin("aa.");
    }
    vector<string> ans(N, string(N, '.'));
    vector<string> p4 = p(4);
    rep(i, N / 4 - 1) {
        rep(j, 4) {
            rep(k, 4) { ans[i * 4 + j][i * 4 + k] = p4[j][k]; }
        }
    }
    vector<string> pm = p(N % 4 + 4);
    rep(i, N % 4 + 4) {
        rep(j, N % 4 + 4) { ans[N - i - 1][N - j - 1] = pm[i][j]; }
    }
    rep(i, N) { cout << ans[i] << endl; }
}


Measured memory_bytes: 2304