#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>

using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "Algebraic.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "BIT.h"
#include "DynamicMod.h"
#include "Factorization.h"
#include "FFT.h"
#include "FlowSolver.h"
#include "Graph.h"
#include "LazySegmentTree.h"
#include "Math.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Polynomial.h"
#include "Position.h"
#include "Range.h"
#include "Rational.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "SlidingWindow.h"
#include "SuffixArray.h"
#include "Tree.h"
#include "UnionFind.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>>(istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<<(ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

int N;
string s[1000];

void sub() {
	int B = N - N / 4 * 4;
	int A = (N - 5 * B) / 4;

	REP(i, 0, N) {
		s[i] = string(N, '.');
	}

	int cnt = 0;
	REP(z, 0, A) {
		string t4[] = {
			"aacd",
			"bbcd",
			"cdaa",
			"cdbb"
		};

		REP(i, 0, 4) {
			REP(j, 0, 4) {
				s[i + 4 * z][j + 4 * z] = t4[i][j];
			}
		}

		cnt += 4;
	}

	REP(z, 0, B) {
		string t5[] = {
			"aabcc",
			"b.bdd",
			"baacc",
			"cdc..",
			"cdc.."
		};

		REP(i, 0, 5) {
			REP(j, 0, 5) {
				s[i + 5 * z + cnt][j + 5 * z + cnt] = t5[i][j];
			}
		}
	}
}

int main() {
	cin >> N;
	
	if (N == 2) {
		cout << -1 << endl;
		return 0;
	}
	
	
	if (N == 3) {
		s[0] = "aab";
		s[1] = "b.b";
		s[2] = "baa";
	} else if (N == 4) {
		s[0] = "aacd";
		s[1] = "bbcd";
		s[2] = "cdaa";
		s[3] = "cdbb";
	} else if (N == 5) {
		s[0] = "aabcc";
		s[1] = "b.bdd";
		s[2] = "baacc";
		s[3] = "cdc..";
		s[4] = "cdc..";
	} else if (N == 6) {
		s[0] = "aab...";
		s[1] = "b.b...";
		s[2] = "baa...";
		s[3] = "...aab";
		s[4] = "...b.b";
		s[5] = "...baa";
	} else if (N == 7) {
		s[0] = "aab...c";
		s[1] = "b.b...c";
		s[2] = "baa...d";
		s[3] = "...aabd";
		s[4] = "...b.bc";
		s[5] = "...baac";
		s[6] = "ccddcc.";
	} else if (N == 11) {
		s[0] = "aab...c....";
		s[1] = "b.b...c....";
		s[2] = "baa...d....";
		s[3] = "...aabd....";
		s[4] = "...b.bc....";
		s[5] = "...baac....";
		s[6] = "ccddcc.....";
		s[7] = ".......aacd";
		s[8] = ".......bbcd";
		s[9] = ".......cdaa";
		s[10] = ".......cdbb";
	} else {
		sub();
	}

	REP(i, 0, N) {
		cout << s[i] << endl;
	}
	return 0;
}

Measured memory_bytes: 2304