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

#define LL long long
typedef pair<int, int> pii;

template< typename T > inline void read(T &x)
{
    static char _c;
    static bool _f;

    x = 0;
    _f = 0;
    _c = getchar();

    while(_c < '0' || '9' < _c) {if(_c == '-') _f = true; _c = getchar();}
    while('0' <= _c && _c <= '9') {x = (x << 1) + (x << 3) + (_c & 15); _c = getchar();}
    if(_f) x = -x;
}

template < typename T > inline void Min(T &x, T y) {if(y < x) x = y;}
template < typename T > inline void Max(T &x, T y) {if(x < y) x = y;}


#define lowbit(x) ((x) & -(x))
#define lson l,mid,id<<1
#define rson mid+1,r,id<<1|1
#define ls id<<1
#define rs id<<1|1
#define MID(l,r) ((l)+(((r)-(l))>>1))
#define fi first
#define se second
#define mk make_pair
#define pb push_back

const int INF = 0x3f3f3f3f;
const double pi = (double) acos(-1.0);
const double eps = (double) 1e-8;
const int MOD = (int) 1e9 + 7;
//const int MOD = (int) 998244353;
//int MOD = 998244353;
const int maxn = (int) 1e5 + 20;
const int maxm = (int) 1e6 + 20;

inline int sig(double x) {return x < -eps ? -1 : eps < x;}
LL fp(LL a, LL n, LL mod = MOD)
{
    if(n < 0) a = fp(a, mod - 2, mod), n = -n;
    LL res = 1; for(; n; n >>= 1, a = a * a % mod) if(n & 1) res = res * a % mod; return res;
}

struct Mint
{
    LL x;
    Mint() {x = 0;}
    Mint(int _x): x(_x) {}
    Mint(LL _x): x(_x) {}
    Mint operator - () const{
        return Mint(MOD - x);
    }
    Mint operator + (const Mint &rhs) const{
        LL res = x + rhs.x; if(res >= MOD) res -= MOD; return Mint(res);
    }
    Mint operator - (const Mint &rhs) const{
        LL res = x - rhs.x; if(res < 0) res += MOD; return Mint(res);
    }
    Mint operator * (const Mint &rhs) const{
        return Mint(x * rhs.x % MOD);
    }
    Mint operator / (const Mint &rhs) const{
        return Mint(x * fp(rhs.x, -1) % MOD);
    }
    bool operator == (const Mint &rhs) const{
        return x == rhs.x;
    }
    bool operator != (const Mint &rhs) const{
        return x != rhs.x;
    }
    friend ostream& operator << (ostream &out, const Mint &rhs){
        return out << rhs.x;
    }
    friend istream& operator >> (istream &in, Mint &rhs){
        return in >> rhs.x;
    }
};

const string g3[] = {
    "aab",
    "d.b",
    "dcc",
};
const string g4[] = {
    "abcc",
    "abdd",
    "eefg",
    "hhfg",
};
const string g5[] = {
    "abc..",
    "abc..",
    "deeff",
    "d.ghh",
    "iigjj",
};
const string g6[] = {
    "abc...",
    "abc...",
    "d.eeff",
    "dghh..",
    ".g.ijj",
    "kk.ill",
};
const string g7[] = {
    "abc....",
    "abc....",
    "def....",
    "def....",
    "g..hhii",
    "g..jjkk",
    ".llmmnn",
};

char s[1111][1111];

void work()
{
    int n;
    cin >>n;
    if(n == 2)
    {
        cout <<-1;
        return ;
    }

    if(n == 3)
    {
        for(int i = 0; i < 3; i++) cout <<g3[i] <<endl;
    }
    else if(n == 4)
    {
        for(int i = 0; i < 4; i++) cout <<g4[i] <<endl;
    }
    else if(n == 5)
    {
        for(int i = 0; i < 5; i++) cout <<g5[i] <<endl;
    }
    else if(n == 6)
    {
        for(int i = 0; i < 6; i++) cout <<g6[i] <<endl;
    }
    else if(n == 7)
    {
        for(int i = 0; i < 7; i++) cout <<g7[i] <<endl;
    }
    else
    {
        for(int i = 0; i < n; i++)
            for(int j = 0; j < n; j++)
                s[i][j] = '.';

        int d = n / 4, m = n % 4;
        int x = 0, y = 0;

        d -= m;
        if(d == -1)
        {
            for(int i = 0; i < 5; i++)
                for(int j = 0; j < 5; j++)
                    s[i][j] = g5[i][j];
            for(int i = 0; i < 6; i++)
                for(int j = 0; j < 6; j++)
                    s[i + 5][j + 5] = g6[i][j];
        }
        else
        {
            for(int dc = 0; dc < d; dc++)
            {
                for(int i = 0; i < 4; i++)
                    for(int j = 0; j < 4; j++)
                        s[i + x][j + y] = g4[i][j];

                x += 4, y += 4;
            }
            for(int mc = 0; mc < m; mc++)
            {
                for(int i = 0; i < 5; i++)
                    for(int j = 0; j < 5; j++)
                        s[i + x][j + y] = g5[i][j];

                x += 5, y += 5;
            }

        }

        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < n; j++)
                cout <<s[i][j];
            cout <<endl;
        }
        cout <<endl;
    }
}

int main(int argc, char **argv)
{
#ifdef yukihana0416
freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif // yukihana0416
//    get_prime();
//    pre();
    int tc = 1;
//    read(tc);
    for(int ca = 1; ca <= tc; ca++)
    {
//        printf("Case #%d: ", ca);
        work();
    }
    return 0;
}


Measured memory_bytes: 2304