/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author majk
 */

#ifndef MAJK_LIB
#define MAJK_LIB

#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <array>
#include <bitset>
using namespace std;

#define x first
#define y second
typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;

template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.x << ' ' << p.y; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
ui logceil(ll x) { return x?8*sizeof(ll)-__builtin_clzll(x):0; }

namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename F> double bshd(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){l=m;}else{h=m;}}return (l+h)/2;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename F> double bsld(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){h=m;}else{l=m;}}return (l+h)/2;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }


template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};
template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};
template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};


#endif

class Domino {
public:
    void solve(istream& cin, ostream& cout) {
        int N; cin >> N;
        if (N%3 == 0) {
            vector<string> A(N, string(N, '.'));
            for (int i = 0; i < N; i += 3) {
                A[i][i] = 'a';
                A[i][i+1] = 'a';
                A[i][i+2] = 'b';
                A[i+1][i+2] = 'b';
                A[i+2][i+2] = 'c';
                A[i+2][i+1] = 'c';
                A[i+2][i] = 'd';
                A[i+1][i] = 'd';
            }
            for (string a: A) cout << a << '\n';
        } else if (N == 7) {
            cout << "aabc...\n";
            cout << "d.bc...\n";
            cout << "dcc.f..\n";
            cout << "ee..fgg\n";
            cout << "..hhiij\n";
            cout << "...kl.j\n";
            cout << "...klmm\n";
        } else if (N == 11) {
            cout << "aabc.......\n";
            cout << "d.bc.......\n";
            cout << "dcc.f......\n";
            cout << "ee..fgg....\n";
            cout << "..hhiij....\n";
            cout << "...kl.j....\n";
            cout << "...klmm....\n";
            cout << ".......aabc\n";
            cout << ".......ddbc\n";
            cout << ".......efgg\n";
            cout << ".......efhh\n";
        } else {
            for (int four = 0; four <= N/4; ++four) {
                if ((N-4*four)%5 == 0) {
                    int five = (N-4*four)/5;
                    vector<string> A(N, string(N, '.'));
                    for (int i = 0; i < 4*four; i += 4) {
                        A[i][i] = 'e';
                        A[i][i + 1] = 'e';
                        A[i+1][i] = 'f';
                        A[i+1][i + 1] = 'f';
                        A[i+2][i + 2] = 'g';
                        A[i+2][i + 3] = 'g';
                        A[i+3][i + 2] = 'h';
                        A[i+3][i + 3] = 'h';
                        A[i][i+2] = 'i';
                        A[i+1][i+2] = 'i';
                        A[i][i+3] = 'j';
                        A[i+1][i+3] = 'j';
                        A[i+2][i] = 'k';
                        A[i+3][i] = 'k';
                        A[i+2][i+1] = 'l';
                        A[i+3][i+1] = 'l';
                    }
                    for (int i = 4*four; i < 4*four + 5*five; i += 5) {
                        A[i][i] = 'm';
                        A[i][i + 1] = 'm';
                        A[i][i+2] = 'n';
                        A[i][i+3] = 'n';
                        A[i][i+4] = 'o';
                        A[i+1][i+4] = 'o';
                        A[i+2][i +4] = 'p';
                        A[i+3][i + 4] = 'p';
                        A[i+4][i + 4] = 'q';
                        A[i+4][i + 3] = 'q';
                        A[i+4][i+2] = 'r';
                        A[i+4][i+1] = 'r';
                        A[i+4][i] = 's';
                        A[i+3][i] = 's';
                        A[i+2][i] = 't';
                        A[i+1][i] = 't';
                        A[i+1][i+1] = 'u';
                        A[i+1][i+2] = 'u';
                        A[i+2][i+3] = 'v';
                        A[i+3][i+3] = 'v';
                    }
                    for (string a: A) cout << a << '\n';
                    return;
                }
            }

            cout << -1 << endl;
        }
    }
};


int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	Domino solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
    return 0;
}


Measured memory_bytes: 2304