#pragma GCC optimize ("-O3")
#include <bits/stdc++.h>  
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(int i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 1e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
 
ll mpow(ll a, ll b){
	if(b >= (MOD-1)) b %= (MOD-1);
	if(b==0) return 1;
	ll t1 = mpow(a,b/2);
	t1 *= t1;
	t1 %= MOD;
	if(b%2) t1 *= a;
	t1 %= MOD;
	return t1;
}
 
ll mpow(ll a, ll b, ll p){
	if(b==0) return 1;
	ll t1 = mpow(a,b/2,p);
	t1 *= t1;
	t1 %= p;
	if(b%2) t1 *= a;
	t1 %= p;
	return t1;
}
 
ll modinverse(ll a, ll m){
	ll m0 = m; 
    ll y = 0, x = 1; 
    if (m == 1) return 0; 
    while (a > 1){
        ll q = a / m; 
        ll t = m; 
        m = a % m, a = t; 
        t = y; 
        y = x - q * y; 
        x = t; 
    }
    if (x < 0) x += m0; 
    return x; 
}
 
ll range(ll l, ll r){
	return l + rand()%(r-l+1);
}
 
ll rev(ll v){
	return mpow(v,MOD-2);
}
 
void solve(){
	ll n;
	cin >> n;
	char ans[n][n];
	forn(i,n) forn(j,n) ans[i][j]='.';
	if(n==2){
		cout << -1 << ln;
		return;
	}
	else if(n==3){
		ans[0][0]='a';
		ans[1][0]='a';
		ans[2][1]='b';
		ans[2][2]='b';
	}
	else if(n==4){
		ans[0][0]='a';
		ans[0][1]='a';
		ans[0][2]='c';
		ans[0][3]='d';
		ans[1][0]='b';
		ans[1][1]='b';
		ans[1][2]='c';
		ans[1][3]='d';
		ans[2][0]='e';
		ans[2][1]='f';
		ans[2][2]='g';
		ans[2][3]='g';
		ans[3][0]='e';
		ans[3][1]='f';
		ans[3][2]='h';
		ans[3][3]='h';
	}
	else if(n==5){
		ans[0][0]=ans[0][1]='a';
		ans[1][1]=ans[1][2]='b';
		ans[2][0]=ans[2][1]='c';
		ans[2][2]=ans[2][3]='d';
		ans[4][3]=ans[4][4]='e';
		ans[0][3]=ans[1][3]='f';
		ans[0][4]=ans[1][4]='g';
		ans[2][4]=ans[3][4]='h';
		ans[3][0]=ans[4][0]='i';
		ans[3][2]=ans[4][2]='j';
	}
	else{
		forn(i,n-2){
			if(i%2) {
				ans[i][i]=ans[i+1][i]='a';
			}
			else{
				ans[i][i]=ans[i+1][i]='b';
			}
		}
		ans[n-2][0]=ans[n-1][0]=ans[n-1][n-1]=ans[n-2][n-1]='c';
		forn(i,n-3){
			if(i%2) {
				ans[i][i+2]=ans[i][i+3]='d';
			}
			else{
				ans[i][i+2]=ans[i][i+3]='e';
			}
		}
		ans[0][n-2]=ans[0][n-1]=ans[n-3][0]=ans[n-3][1]=ans[n-1][1]=ans[n-1][2]='f';
	}
	forn(i,n){
		forn(j,n) cout << ans[i][j];
		cout << ln;
	}
}
 
int main()
{
	fast_cin();
    ll t=1;
    // cin>>t;
    forn(i,t) {
    	// cout << "Case #" << i+1 << ": ";
    	solve();
    }
    return 0;
}

Measured memory_bytes: 2304