//Create Time: 2020-01-24 16:14:13
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <functional>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cctype>
#include <ctime>
#include <utility>
#include <complex>
#include <cassert>
#include <climits>
#include <iterator>
#include <tuple>
using namespace std;
#define snuke(i,x) for (__typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,n,a) for (int i=(n)-1;i>=(a);i--)
// #define OUT(x) std::cout<<(#x)<<":"<<(x)<<std::endl
// #define TST(x) std::cout<<(#x)<<":"<<(x)<<" "
#define OUT(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("\n",_it,args);}
#define TST(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("",_it,args);}
#define SZ(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define unq(x) sort(all(x)),(x).erase(unique(all(x)),(x).end())
#define mem(f,x) memset((f), (x), sizeof(f))
#define clr(f) mem(f,0)
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define eb emplace_back
#define DEBUG
void OUT_TST(string s,istream_iterator<string> it) {cerr<<s;}
template<typename T, typename... Args> void OUT_TST(string s,istream_iterator<string> it,T a,Args... args){cerr<<*it<<"="<<a<<" ";OUT_TST(s,++it,args...);}
template<class T> void rd(T&ret){ret=0;bool ok=0,u=0;for(;;){int c=getchar();if(c>='0'&&c<='9')ret=(ret<<3)+(ret<<1)+c-'0',ok=1;else if(c=='-')u=1;else if(ok){if(u)ret*=-1;return;}}}
long long powmod(long long p,long long n,long long mod){long long ret=1;for(;n;n>>=1){if(n&1)ret=ret*p%mod;p=p*p%mod;}return ret;}
template <class T> bool chmin(T& a, const T &b) {return b < a? a = b, 1: 0;}
template <class T> bool chmax(T& a, const T &b) {return b > a? a = b, 1: 0;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef tuple<int,int,int> tp;
/****head****/
map<int, vector<string> > has;
void init(){
    vector<string> an, bn, cn, dn, en;
    an.pb("aa.");
    an.pb("..b");
    an.pb("..b");

    bn.pb("aacd");
    bn.pb("bbcd");
    bn.pb("efgg");
    bn.pb("efhh");

    cn.pb("..abc");
    cn.pb("..abc");
    cn.pb("ddeff");
    cn.pb("gge.h");
    cn.pb("iijjh");

    // brute-force search follow results
    dn.pb("...abc");
    dn.pb("...abc");
    dn.pb("d.ee.f");
    dn.pb("dgg..f");
    dn.pb("hhi.jj");
    dn.pb("kkill.");

    en.pb("....abc");
    en.pb("....abc");
    en.pb("....def");
    en.pb("....def");
    en.pb("gghh..i");
    en.pb("jjkk..i");
    en.pb("llmmnn.");

    has.clear();
    has[3]=an;
    has[4]=bn;
    has[5]=cn;
    has[6]=dn;
    has[7]=en;
}
char ans[1005][1005];
void fill_default(int n){
    rep(i,0,n){
        rep(j,0,n) ans[i][j]='.';
        ans[i][n]=0;
    }
}
void solve(int offset, int n){
    if(n == 3 || n == 4 || n == 5 || n == 6 || n == 7){
        rep(i,0,n) rep(j,0,n){
            ans[offset+i][offset+j]=has[n][i][j];
        }
        return;
    }
    rep(i,0,4) rep(j,0,4) ans[offset+i][offset+j]=has[4][i][j];
    solve(offset+4, n-4);
}
int main(){
    int n; scanf("%d", &n);
    init();
    if(n == 2) puts("-1");
    else {
        fill_default(n);
        solve(0, n);
        rep(i,0,n) puts(ans[i]);
    }
    return 0;
}


Measured memory_bytes: 2304