#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < A[i].size(); j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}
template < typename T, typename U >
ostream &operator<<(ostream &os, const pair< T, U > &p) {
	os << "(" << p.first << "," << p.second << ")";
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c, i;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};
struct aabb {
	int x1, y1, x2, y2;
	aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

template < typename A, size_t N, typename T >
void Fill(A (&array)[N], const T &val) {
	fill((T *)array, (T *)(array + N), val);
}
struct initializer {
	initializer() {
		cout << fixed << setprecision(20);
	}
};
initializer _____;

int N, M, K, T, Q, H, W;
signed main() {
	cin >> N;
	if (N == 2)
		cout << -1 << endl;
	else if (N == 3) {
		cout << ".aa" << endl
			 << "a.." << endl
			 << "a.." << endl;
	} else {
		vector< string > four(4);
		four[0] = "abcc";
		four[1] = "abdd";
		four[2] = "ccab";
		four[3] = "ddab";
		vector< string > five(5);
		five[0] = "abc..";
		five[1] = "abc..";
		five[2] = "deeaa";
		five[3] = "d.dbb";
		five[4] = "eedcc";
		vector< string > six(6);
		six[0] = ".aabcc";
		six[1] = "a..b.b";
		six[2] = "a..ccb";
		six[3] = "bcc..a";
		six[4] = "b.b..a";
		six[5] = "ccbaa.";
		vector< string > seven(7);
		seven[0] = "abc....";
		seven[1] = "abc....";
		seven[2] = "bca....";
		seven[3] = "bca....";
		seven[4] = "d..aabb";
		seven[5] = "d..bbcc";
		seven[6] = ".ddccaa";
		vector< string > ans(N);
		rep(i, N) rep(j, N) ans[i].push_back('.');
		M = N;
		while (N >= 8) {
			N -= 4;
			for (int i = N; i < N + 4; i++)
				for (int j = N; j < N + 4; j++) {
					ans[i][j] = four[i - N][j - N];
				}
		}
		int k = N;
		if (k == 4) {
			for (int i = 0; i < k; i++)
				for (int j = 0; j < k; j++) {
					ans[i][j] = four[i][j];
				}
		}
		if (k == 5) {
			for (int i = 0; i < k; i++)
				for (int j = 0; j < k; j++) {
					ans[i][j] = five[i][j];
				}
		}
		if (k == 6) {
			for (int i = 0; i < k; i++)
				for (int j = 0; j < k; j++) {
					ans[i][j] = six[i][j];
				}
		}
		if (k == 7) {
			for (int i = 0; i < k; i++)
				for (int j = 0; j < k; j++) {
					ans[i][j] = seven[i][j];
				}
		}
		rep(i, M) cout << ans[i] << endl;
	}
	return 0;
}

Measured memory_bytes: 5532