// #pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <list>
 
// hloya template v25
  
// ░░░░░░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░░░░░
// ░░░░░░█░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░█░░░░░
// ░░░░░░█░█░▀░░░░░▀░░▀░░░░█░█░░░░░
// ░░░░░░█░█░░░░░░░░▄▀▀▄░▀░█░█▄▀▀▄░
// █▀▀█▄░█░█░░▀░░░░░█░░░▀▄▄█▄▀░░░█░
// ▀▄▄░▀██░█▄░▀░░░▄▄▀░░░░░░░░░░░░▀▄
// ░░▀█▄▄█░█░░░░▄░░█░░░▄█░░░▄░▄█░░█
// ░░░░░▀█░▀▄▀░░░░░█░██░▄░░▄░░▄░███
// ░░░░░▄█▄░░▀▀▀▀▀▀▀▀▄░░▀▀▀▀▀▀▀░▄▀░
// ░░░░█░░▄█▀█▀▀█▀▀▀▀▀▀█▀▀█▀█▀▀█░░░
// ░░░░▀▀▀▀░░▀▀▀░░░░░░░░▀▀▀░░▀▀░░░░
  
#include <bits/stdc++.h>
#include <valarray>
using namespace std;
  
bool dbg = 0;
  
clock_t start_time = clock();
#define current_time fixed<<setprecision(6)<<(ld)(clock()-start_time)/CLOCKS_PER_SEC
  
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
  
#define ll long long
#define ld long double
#define pii pair<int,int>
#define umap unordered_map<int, int>
  
#define files1 freopen("input.txt","r",stdin)
#define files2 freopen("output.txt","w",stdout)
#define files files1;files2
#define fast_io ios_base::sync_with_stdio(0);cin.tie(0)
  
// #define endl '\n'
#define ln(i,n) " \n"[(i) == (n) - 1]
  
void bad(string mes = "Impossible"){cout << mes;exit(0);}
void bad(int mes){cout << mes;exit(0);}
  
template<typename T>
string bin(T x, int st = 2){
    string ans = "";
    while (x > 0){
        ans += char('0' + x % st);
        x /= st;
    }
    reverse(ans.begin(), ans.end());
    return ans.empty() ? "0" : ans;
}
  
template<typename T>
void upmax(T& x, T y) {
    x = max(x, y);
}
  
template<typename T>
void upmin(T& x, T y) {
    x = min(x, y);
}
 
// inline int popcount(int x){
//     int count = 0;
//     __asm__ volatile("POPCNT %1, %0;":"=r"(count):"r"(x):);
//     return count;
// }
  
template<typename T>
T input(){
    T ans = 0, m = 1;
    char c = ' ';
  
    while (!((c >= '0' && c <= '9') || c == '-')) {
        c = getchar();
    }
  
    if (c == '-')
        m = -1, c = getchar();
    while (c >= '0' && c <= '9'){
        ans = ans * 10 + (c - '0'), c = getchar();
    }
    return ans * m;
}
  
template<typename T> void read(T& a) { a = input<T>(); }
template<typename T> void read(T& a, T& b) { read(a), read(b); }
template<typename T> void read(T& a, T& b, T& c) { read(a, b), read(c); }
template<typename T> void read(T& a, T& b, T& c, T& d) { read(a, b), read(c, d); }
  
const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-6;
const int maxn = (int)3e5 + 12;//, base = 1e9 + 7;
const ll llinf = 2e18 + 5;
const double PI = acos(-1.0);
 
const int mod = 1e9 + 7;
  
template<typename T>
T binpow(T n, T s)
{
    if (s <= 0)
        return 1LL;
    if (s % 2 == 0){
        T b = binpow(n, s / 2);
        return ( 1LL * b * b ) % mod;
    } else {
        return (1LL* binpow(n, s - 1) * n) % mod;
    }
}

char ans[1001][1001];

vector<string> ans4 = {
	"aabc",
	"ddbc",
	"abdd",
	"abcc"
};

vector<string> ans5 = {
	"aa.bc",
	"..ebc",
	"bbeaa",
	"a.bbe",
	"acc.e"
};

vector<string> ans7 = {
	"aa.dda.",
	"bcc..a.",
	"b.b..bb",
	"..baa.c",
	"a..c..c",
	"a..ca..",
	".bb.abb"
};

int main() {
	// files1;
	fast_io;

	int n;
	cin >> n;

	if (n == 2) {
		cout << -1;
		return 0;
	}

	if (n % 3 == 0) { 
		for (int i = 0; i + 2 < n; i += 3)
			for (int j = 0; j + 2 < n; j += 3) {
				ans[i][j] = 'a';
				ans[i][j+1] = 'a';
				ans[i+1][j+2] = 'b';
				ans[i+2][j+2] = 'b';
			}
	} else {
		if (n == 7) {
			for (int i = 0; i < 7; i++)
				for (int j = 0; j < 7; j++) {
					cout << ans7[i][j];
					if( j == 6) {
						cout << endl;
					}
				}
				return 0;
		} else {
			int a, b = -1;
			for (int x = 0; x <= n; x++)
				for (int y = 0; y <= n; y++) {
					if (4 * x + 5 * y == n) {
						a = x, b = y;
					}
				}
			if (b == -1) {
				a = 1;
			}

			for (int i = 0; i < a; i++)  {
				int x = i * 4, y = i * 4;
				for (int q = 0; q < 4; q++)
					for (int w = 0; w < 4; w++) {
						ans[x + q][y + w] = ans4[q][w];
					}
			}

			if (b == -1) {
				b = 1;
			for (int i = 0; i < b; i++)  {
				int x = a * 4 + i * 5, y = a * 4 + i * 5;
				for (int q = 0; q < 7; q++)
					for (int w = 0; w < 7; w++) {
						ans[x + q][y + w] = ans7[q][w];
					}
			}
			} else {
			for (int i = 0; i < b; i++)  {
				int x = a * 4 + i * 5, y = a * 4 + i * 5;
				for (int q = 0; q < 5; q++)
					for (int w = 0; w < 5; w++) {
						ans[x + q][y + w] = ans5[q][w];
					}
			}
		}
		}
	}

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++) {
			if (!ans[i][j]) ans[i][j] = '.';
			cout << ans[i][j];
			if (j == n - 1) {
				cout << endl;
			}
		}

	return 0;
}


Measured memory_bytes: 2176