// need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <fstream>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest& ...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest& ...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest& ...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
template<typename T>void MACRO_OUT(const T t) { std::cout << t; }
template<typename First, typename...Rest>void MACRO_OUT(const First first, const Rest...rest) { std::cout << first << " "; MACRO_OUT(rest...); }
#define OUT(...) MACRO_OUT(__VA_ARGS__);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t: " << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t: ";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t: ";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
#define SHOWSTACK(a) {auto tmp(a);std::cerr << #a << "\t: ";while(!tmp.empty()){std::cerr << tmp.top() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define REP(w, n) for(int w=0;w<int(n);++w)
#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)
#define IN(a, x, b) (a<=x && x<b)
template<class T> inline T CHMAX(T & a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
// test
template<class T> using V = std::vector<T>;
template<class T> using VV = V<V<T>>;

template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = (1 << 30) - 1;                    // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-10;
constexpr int MOD = 998244353;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T & val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T & val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T> & a, const T & val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>> & a, const T & val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------

bool check(const VV<int> & a) {
	int n = a.size();
	int res = -1;
	REP(i, n) {
		std::set<int> set;
		REP(j, n) {
			if (a[i][j] != 0) set.insert(a[i][j]);
		}
		if (res == -1) res = set.size();
		else if (res != (int)set.size()) return false;
	}
	REP(j, n) {
		std::set<int> set;
		REP(i, n) {
			if (a[i][j] != 0) set.insert(a[i][j]);
		}
		if (res != (int)set.size()) return false;
	}
	return true;
}

void calc(VV<int> a, int i, int j, int p) {
	int n = a.size();
	if (j == n) {
		++i;
		j = 0;
		if (i == n) {
			if (check(a)) {
				OUT("====================================================")BR;
				REP(i, n) REP(j, n) {
					SOUT(2, ' ', a[i][j])SPBR(j, n);
				}
				FLUSH;
			}
			return;
		}
	}
	if (j + 1 < n && a[i][j] == 0 && a[i][j + 1] == 0) {
		a[i][j] = a[i][j + 1] = p;
		calc(a, i, j + 1, p + 1);
		a[i][j] = a[i][j + 1] = 0;
	}
	if (i + 1 < n && a[i][j] == 0 && a[i + 1][j] == 0) {
		a[i][j] = a[i + 1][j] = p;
		calc(a, i, j + 1, p + 1);
		a[i][j] = a[i + 1][j] = 0;
	}
	calc(a, i, j + 1, p);
}

void reverse(VV<int> & a) {
	int n = a.size();
	auto b(a);
	REP(i, n) REP(j, n) a[i][j] = b[j][i];
}
VV<int> make(int n, bool rev) {
	if (n == 2) return {};

	VV<int> a(n, V<int>(n, 0));
	if (n == 3) {
		a[0][0] = a[0][1] = 1;
		a[0][2] = a[1][2] = 2;
		a[1][0] = a[2][0] = 3;
		a[2][1] = a[2][2] = 4;
		if (rev) reverse(a);
		return a;
	}
	if (n == 4) {
		a[0][0] = a[0][1] = 1;
		a[1][0] = a[1][1] = 2;
		a[0][2] = a[1][2] = 3;
		a[0][3] = a[1][3] = 4;
		a[2][0] = a[3][0] = 5;
		a[2][1] = a[3][1] = 6;
		a[2][2] = a[2][3] = 7;
		a[3][2] = a[3][3] = 8;
		if (rev) reverse(a);
		return a;
	}
	if (n == 5) {
		a[0][0] = a[0][1] = 1;
		a[1][0] = a[1][1] = 2;
		a[2][0] = a[2][1] = 3;
		a[3][2] = a[4][2] = 4;
		a[3][3] = a[4][3] = 5;
		a[3][4] = a[4][4] = 6;
		a[0][2] = a[0][3] = 7;
		a[0][4] = a[1][4] = 8;
		a[1][2] = a[2][2] = 9;
		a[2][3] = a[2][4] = 10;
		if (rev) reverse(a);
		return a;
	}
	if (n == 7) {
		a[0][0] = a[0][1] = 1;
		a[0][2] = a[1][2] = 2;
		a[1][0] = a[2][0] = 3;
		a[2][1] = a[2][2] = 4;
		a[3][3] = a[3][4] = 5;
		a[3][5] = a[4][5] = 6;
		a[4][3] = a[5][3] = 7;
		a[5][4] = a[5][5] = 8;
		a[6][0] = a[6][1] = 9;
		a[6][2] = a[6][3] = 10;
		a[6][4] = a[6][5] = 11;
		a[0][6] = a[1][6] = 12;
		a[2][6] = a[3][6] = 13;
		a[4][6] = a[5][6] = 14;
		if (rev) reverse(a);
		return a;
	}

	if (n % 2 == 1 && (n / 2) % 2 == 1) return {};

	if (n % 2 == 0) {
		auto b0 = make(n / 2, true);
		auto b1 = make(n / 2, false);
		if (b0.empty()) return {};
		if (b1.empty()) return {};
		int p = 0;
		REP(i, n / 2) REP(j, n / 2) a[i][j] = b0[i][j] + p * !!(b0[i][j]);
		p += (n / 2) * (n / 2) / 2 + 1;
		REP(i, n / 2) REP(j, n / 2) a[i][j + n / 2] = b1[i][j] + p * !!(b1[i][j]);
		p += (n / 2) * (n / 2) / 2 + 1;
		REP(i, n / 2) REP(j, n / 2) a[i + n / 2][j] = b1[i][j] + p * !!(b1[i][j]);
		p += (n / 2) * (n / 2) / 2 + 1;
		REP(i, n / 2) REP(j, n / 2) a[i + n / 2][j + n / 2] = b0[i][j] + p * !!(b0[i][j]);
		if (rev) reverse(a);
		return a;
	}
	if (n % 2 == 1 && (n / 2) % 2 == 0) {
		auto b0 = make((n - 1) / 2, true);
		auto b1 = make((n + 1) / 2, true);
		if (b0.empty()) return {};
		if (b1.empty()) return {};
		int p = 0;
		REP(i, (n - 1) / 2) REP(j, (n - 1) / 2) a[i][j] = b0[i][j] + p * !!(b0[i][j]);
		p += (n / 2) * (n / 2) / 2 + 1;
		REP(i, (n + 1) / 2) REP(j, (n + 1) / 2) a[i + (n - 1) / 2][j + (n - 1) / 2] = b1[i][j] + p * !!(b1[i][j]);
		if (rev) reverse(a);
		return a;
	}
}

signed main() {
	INIT;

	VAR(int, n);
	VV<int> a(n, V<int>(n, 0));

	auto show = [&] {
		REP(i, n) {
			REP(j, n) {
				if (a[i][j] == 0) {
					OUT('.');
				}
				else {
					OUT((char)('a' + a[i][j] - 1));
				}
			}BR;
		}
		exit(0);
	};

	if (n == 7) {
		a = make(7, true);
		show();
	}
	if (n == 11) {
		auto a4 = make(4, true);
		auto a7 = make(7, true);
		int ni = 0, nj = 0;
		REP(i, 4) REP(j, 4) a[i + ni][j + ni] = a4[i][j];
		ni += 4; nj += 4;
		REP(i, 7) REP(j, 7) a[i + ni][j + ni] = a7[i][j];
		show();
	}

	auto a4 = make(4, true);
	auto a5 = make(5, true);
	REP(is, 200) REP(js, 200) {
		if (4 * is + 5 * js == n) {
			int ni = 0, nj = 0;
			REP(k, is) {
				REP(i, 4) REP(j, 4) a[i + ni][j + ni] = a4[i][j];
				ni += 4; nj += 4;
			}
			REP(k, js) {
				REP(i, 5) REP(j, 5) a[i + ni][j + ni] = a5[i][j];
				ni += 5; nj += 5;
			}
			show();
		}
	}

	{
		auto v = make(n, true);
		if (v.empty()) {
			OUT(-1)BR;
			return 0;
		}
		a = v;
		show();
	}

	/*
	VAR(int, n);
	VV<int> a(n, V<int>(n, 0));
	calc(a, 0, 0, 1);
	*/
	return 0;
}

Measured memory_bytes: 9088