import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;

	auto ans = new char[][](N, N);
	foreach (y; 0..N)
	{
		foreach (x; 0..N)
		{
			ans[y][x] = '.';
		}
	}

	if (N % 3 == 0)
	{
		foreach (i; 0..N/3)
		{
			auto p = i*3;
			ans[p][p] = 'a';
			ans[p][p+1] = 'a';
			ans[p+1][p+2] = 'b';
			ans[p+2][p+2] = 'b';
		}
		foreach (e; ans)
			writeln(e);
	}
	else if (N % 4 == 0)
	{
		foreach (i; 0..N/4)
		{
			auto p = i*4;
			foreach (j; 0..2)
			{
				auto pp = p+j*2;
				ans[pp][pp] = 'a';
				ans[pp][pp+1] = 'a';
				ans[pp+1][pp] = 'b';
				ans[pp+1][pp+1] = 'b';
			}
			ans[p][p+2] = 'c';
			ans[p+1][p+2] = 'c';
			ans[p][p+3] = 'd';
			ans[p+1][p+3] = 'd';
			ans[p+2][p] = 'c';
			ans[p+3][p] = 'c';
			ans[p+2][p+1] = 'd';
			ans[p+3][p+1] = 'd';
		}
		foreach (e; ans)
			writeln(e);
	}
	else if (N % 5 == 0)
	{
		foreach (i; 0..N/5)
		{
			auto p = i*5;
			auto pp = p + 1;
			ans[pp][pp] = 'a';
			ans[pp][pp+1] = 'a';
			ans[pp+1][pp+2] = 'b';
			ans[pp+2][pp+2] = 'b';
			
			ans[p][p] = 'c';
			ans[p][p+1] = 'c';
			ans[p][p+2] = 'd';
			ans[p][p+3] = 'd';
			ans[p+4][p+1] = 'c';
			ans[p+4][p+2] = 'c';
			ans[p+4][p+3] = 'd';
			ans[p+4][p+4] = 'd';
			ans[p+1][p] = 'e';
			ans[p+2][p] = 'e';
			ans[p+3][p] = 'f';
			ans[p+4][p] = 'f';
			ans[p][p+4] = 'e';
			ans[p+1][p+4] = 'e';
			ans[p+2][p+4] = 'f';
			ans[p+3][p+4] = 'f';
		}
		foreach (e; ans)
			writeln(e);
	}
	else
		writeln(-1);
	
	stdout.flush;
	debug readln;
}