#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld; 
typedef double db; 
typedef string str; 

typedef pair<int, int> pi;
typedef pair<ll,ll> pl; 
typedef pair<ld,ld> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl;
typedef vector<ld> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x) 
#define rsz resize
#define ins insert 

#define mp make_pair
#define pb push_back
#define eb emplace_back 
#define f first
#define s second
#define lb lower_bound 
#define ub upper_bound 

const int MOD = 1e9+7; // 998244353; // = (119<<23)+1
const int MX = 2e5+5;
const ll INF = 1e18; 
const ld PI = 4*atan((ld)1); 

template<class T> bool ckmin(T& a, const T& b) { 
	return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; }

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());

namespace input {
	template<class T> void re(complex<T>& x);
	template<class T1, class T2> void re(pair<T1,T2>& p);
	template<class T> void re(vector<T>& a);
	template<class T, size_t SZ> void re(array<T,SZ>& a);

	template<class T> void re(T& x) { cin >> x; }
	void re(double& x) { string t; re(t); x = stod(t); }
	void re(ld& x) { string t; re(t); x = stold(t); }
	template<class T, class... Ts> void re(T& t, Ts&... ts) { 
		re(t); re(ts...); 
	}

	template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
	template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
	template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
	template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
	void pr(int x) { cout << x; }
	void pr(long x) { cout << x; }
	void pr(ll x) { cout << x; }
	void pr(unsigned x) { cout << x; }
	void pr(unsigned long x) { cout << x; }
	void pr(unsigned long long x) { cout << x; }
	void pr(float x) { cout << x; }
	void pr(double x) { cout << x; }
	void pr(ld x) { cout << x; }
	void pr(char x) { cout << x; }
	void pr(const char* x) { cout << x; }
	void pr(const string& x) { cout << x; }
	void pr(bool x) { pr(x ? "true" : "false"); }
	template<class T> void pr(const complex<T>& x) { cout << x; }
	
	template<class T1, class T2> void pr(const pair<T1,T2>& x);
	template<class T> void pr(const T& x);
	
	template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
		pr(t); pr(ts...); 
	}
	template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
		pr("{",x.f,", ",x.s,"}"); 
	}
	template<class T> void pr(const T& x) { 
		pr("{"); // const iterator needed for vector<bool>
		bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
		pr("}");
	}
	
	void ps() { pr("\n"); } // print w/ spaces
	template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
		pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
	}
	
	void pc() { pr("]\n"); } // debug w/ commas
	template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
		pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
	}
	#define dbg(x...) pr("[",#x,"] = ["), pc(x);
}

using namespace output;

namespace io {
	void setIn(string s) { freopen(s.c_str(),"r",stdin); }
	void setOut(string s) { freopen(s.c_str(),"w",stdout); }
	void setIO(string s = "") {
		ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
		// cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
		if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
	}
}

using namespace io;

typedef decay<decltype(MOD)>::type T;
struct mi {
	T val; 
	explicit operator T() const { return val; }
	mi() { val = 0; }
	mi(const ll& v) { 
		val = (-MOD <= v && v <= MOD) ? v : v % MOD;
		if (val < 0) val += MOD;
	}
	// friend ostream& operator<<(ostream& os, const mi& a) { 
		// return os << a.val; }
	friend void pr(const mi& a) { pr(a.val); }
	friend void re(mi& a) { ll x; re(x); a = mi(x); }
   
	friend bool operator==(const mi& a, const mi& b) { 
		return a.val == b.val; }
	friend bool operator!=(const mi& a, const mi& b) { 
		return !(a == b); }
	friend bool operator<(const mi& a, const mi& b) { 
		return a.val < b.val; }

	mi operator-() const { return mi(-val); }
	mi& operator+=(const mi& m) { 
		if ((val += m.val) >= MOD) val -= MOD; 
		return *this; }
	mi& operator-=(const mi& m) { 
		if ((val -= m.val) < 0) val += MOD; 
		return *this; }
	mi& operator*=(const mi& m) { 
		val = (ll)val*m.val%MOD; return *this; }
	friend mi pow(mi a, ll p) {
		mi ans = 1; assert(p >= 0);
		for (; p; p /= 2, a *= a) if (p&1) ans *= a;
		return ans;
	}
	friend mi inv(const mi& a) { 
		assert(a != 0); return pow(a,MOD-2); }
	mi& operator/=(const mi& m) { return (*this) *= inv(m); }
	
	friend mi operator+(mi a, const mi& b) { return a += b; }
	friend mi operator-(mi a, const mi& b) { return a -= b; }
	friend mi operator*(mi a, const mi& b) { return a *= b; }
	friend mi operator/(mi a, const mi& b) { return a /= b; }
};

typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

str gr[1000];
int xd[4] = {0,1,0,-1}, yd[4] = {1,0,-1,0};

bool ok(int n, pi x) {
	return 0 <= x.f && x.f < n && 0 <= x.s && x.s < n;
}

set<char> get(int n, pi x) {
	set<char> S;
	F0R(i,4) {
		pi X = {x.f+xd[i],x.s+yd[i]};
		if (ok(n,X)) S.insert(gr[X.f][X.s]);
	}
	return S;
}

void place(int n, pi x, pi y) {
	assert(ok(n,x) && ok(n,y));
	assert(abs(x.f-y.f)+abs(x.s-y.s) == 1);
	if (!(gr[x.f][x.s] == '.' && gr[y.f][y.s] == '.')) {
		ps(x,y);
		F0R(i,n) ps(gr[i]);
		exit(0);
	}
	set<char> X = get(n,x), Y = get(n,y);
	F0R(a,26) if (!X.count('a'+a) && !Y.count('a'+a)) {
		gr[x.f][x.s] = gr[y.f][y.s] = char('a'+a);
		return;
	}
}

int done[13][13];
int des = 3;
vector<pair<pi,pi>> dom, stor[8];

bool okrow(int n, int x) {
	int ret = 0;
	F0R(i,n) {
		if (done[x][i] && (i == 0 || done[x][i] != done[x][i-1])) ret ++;
	}
	return ret == des;
}

bool okcol(int n, int x) {
	int ret = 0;
	F0R(i,n) {
		if (done[i][x] && (i == 0 || done[i][x] != done[i-1][x])) ret ++;
	}
	return ret == des;
}

void prin(int n) {
	F0R(i,n) {
		F0R(j,n) cout << done[i][j] << "\t";
		cout << "\n";
	}
}

bool DONE = 0;

void dfs(int n, int ind) {
	if (DONE) return;
	if (ind%n == 0 && ind > 0) {
		if (!okrow(n,ind/n-1)) return;
		if (ind == n*n) {
			F0R(i,n) if (!okcol(n,i)) return;
			stor[n] = dom; DONE = 1;
			return;
			/*F0R(i,n) {
				F0R(j,n) cout << done[i][j] << "\t";
				cout << "\n";
			}
			exit(0);*/
		}
	}
	dfs(n,ind+1);
	int r = ind/n, c = ind%n;
	if (c < n-1 && !done[r][c] && !done[r][c+1]) {
		done[r][c] = done[r][c+1] = ind+1;
		dom.pb({{r,c},{r,c+1}});
		dfs(n,ind+1);
		dom.pop_back();
		done[r][c] = done[r][c+1] = 0;
	}
	if (r < n-1 && !done[r][c] && !done[r+1][c]) {
		done[r][c] = done[r+1][c] = ind+1;
		dom.pb({{r+1,c},{r,c}});
		dfs(n,ind+1);
		dom.pop_back();
		done[r][c] = done[r+1][c] = 0;
	}
}

void fin(int n, int& cur, int len) {
	int i = cur-len;
	trav(t,stor[len]) place(n,{t.f.f+i,t.f.s+i},{t.s.f+i,t.s.s+i});
	cur  = i;
}

void construct(int n) {
	F0R(i,n) {
		gr[i] = "";
		F0R(j,n) gr[i] += '.';
	}
	//ps(stor[n]); exit(0);
	// dfs(n,0); exit(0);
	if (n%3 == 0) {
		for (int i = 0; i < n; i += 3) {
			place(n,{i,i},{i,i+1});
			place(n,{i+1,i+2},{i+2,i+2});
		}
	} else {
		int cur = n;
		while (cur >= 8) fin(n,cur,4);
		fin(n,cur,cur);
		// 4,5,7
	}
	F0R(i,n) ps(gr[i]);
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int N; re(N);
	if (N == 2) {
		ps(-1);
		exit(0);
	}
	FOR(i,4,8) {
		F0R(a,i) F0R(b,i) done[a][b] = 0;
		DONE = 0;
		dom.clear();
		dfs(i,0);
	}
	construct(N);
	/*exit(0);
	FOR(i,4,8) ps(i,stor[i]);*/
	// FOR(i,3,11) construct(i);
	// you should actually read the stuff at the bottom
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?), slow multiset operations
	* do smth instead of nothing and stay organized
*/

Measured memory_bytes: 2304