#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define Yes "Yes"
#define No "No"
#define DEFAULT LL ans=solve();\
 	if(ans==NONE){\
 	}else{\
 		cout << ans << endl;\
 	}
#define YESNO three(solve(),(OUT(YES),1),(OUT(NO),0))
#define YesNo three(solve(),OUT(Yes),OUT(No))
#define ECHO OUT(solve())
#define three(A,B,C) ((A)?(B):(C))
#define FOR(i,a,b)  for(LL i=(a);i< (LL)(b);i++)
#define EFOR(i,a,b) for(LL i=(a);i<=(LL)(b);i++)
#define RFOR(i,a,b) for(LL i=(b-1);i>=(LL)(a);i--)
#define REP(i,b) FOR(i,zero,b)
#define rep REP
#define EREP(i,b) EFOR(i,zero,b)
#define RREP(i,b) RFOR(i,zero,b)
#define ALL(c) c.begin(),c.end()
#define UNIQUE(c) sort(ALL(c));c.erase(unique(ALL(c)),c.end())
#define MAX(c) (*max_element(ALL(c)))
#define MIN(c) (*min_element(ALL(c)))
#define MP make_pair
#define FI first
#define SE second
#define SI(x) (LL(x.size()))
#define PB push_back
#define DEBUG(a) OUT(a)
#define DEBUG2(a,b) OUT2(a,b)
#define cat cout << __LINE__ << endl
#define OUT(a) cout << (a) << endl
#define OUT2(a,b) cout << (a) <<" "<<(b) << endl
#define zero 0LL
#define all ALL
#define pb emplace_back
#define eb pb
#define int long long
using namespace std;
template<typename T> inline void maximize(T &a, T b) { a = max(a, b); }
template<typename T> inline void minimize(T &a, T b) { a = min(a, b); }
template<typename T> inline bool middle(T a, T b, T c) { return b <= a && a <= c; }
template<class T> inline bool MX(T &l, const T &r) { return l < r ? l = r, 1 : 0; }
template<class T> inline bool MN(T &l, const T &r) { return l > r ? l = r, 1 : 0; }
typedef int LL;
typedef double ld;
typedef int ut;
typedef vector<ut> VI;
typedef vector<VI> VII;
typedef pair<ut, ut> pr;
typedef pair<ut, pr> ppr;
typedef vector<pr> Vpr;
typedef vector<ppr> Vppr;
typedef tuple<int, int, int, int> tapu;
typedef vector<tapu> Vtapu;
typedef priority_queue<pr, Vpr > PQ;
inline void outputVI(VI x) { REP(i, SI(x)) { cout << three(i, " ", "") << x[i]; }OUT(""); }
const int SIZE1 = 5e5 + 1000;
const int SIZE2 = 5010;
const int SIZE3 = 430;
const int SIZE = SIZE1;
const int MAPSIZE = 40;
const LL p998 = 998244353;
const LL p107 = 1000000007;
const LL p = p107;
const LL INF = 1LL << 60;
const long double EPS = 1e-7;
const LL NONE=-2;
#define endl "\n"
ut N, M,K,  Q, D, H, W;
VI edges[SIZE];
LL vals[SIZE], answer = zero;
//LL A[SIZE],B[SIZE],C[SIZE];
bool DP[SIZE];
bool able(int x){
	if(x==0) return true;
	if(x<0) return false;
	if(DP[x]) return DP[x];
	if(able(x-5) or able(x-7) or able(x-9) or able(x-6)) return DP[x]=true;
	return false;
}
char ans[SIZE2][SIZE2];
LL solve2(int x){
	if(x==3){
		cout << "aa."<<endl;
		cout << "..b"<<endl;
		cout << "..b"<<endl;
		return 0;
	}else if(x==4){
		cout << "aabd"<<endl;
		cout << "ccbd"<<endl;
		cout << "efgg"<<endl;	
		cout << "efhh"<<endl;	
		return 0;
	}else if(x==8){
		cout << "aabd...."<<endl;
		cout << "ccbd...."<<endl;
		cout << "efgg...."<<endl;	
		cout << "efhh...."<<endl;	
		cout << "....aabd"<<endl;
		cout << "....ccbd"<<endl;
		cout << "....efgg"<<endl;	
		cout << "....efhh"<<endl;	
		return 0;
	}else if(able(x-5)){
		string s[5]={"abbcc",
			  "a..gf",
			  "b..gf",
			  "bhh.e",
			  "ccdde"};
		REP(i,5)
			REP(j,5){
				ans[i+x-5][j+x-5]=s[i][j];
			}
		solve2(x-5);
	}else if(able(x-6)){
		string s[6]={"abba..",
			  "a.ca..",
			  "ddc.bb",
			  "a..agg",
			  "a..a.c",
			  ".bbddc",};
		REP(i,6)
			REP(j,6){
				ans[i+x-6][j+x-6]=s[i][j];
			}	
		solve2(x-6);
	}else if(able(x-7)){
		string s[7]={
			  "a..a..g",
			  "a..a..g",
			  ".bb.bbh",
			  "a..a..h",
			  "a..a..i",
			  ".bb.bbi",
			  "jjkkll."};
		REP(i,7)
			REP(j,7){
				ans[i+x-7][j+x-7]=s[i][j];
			}	
		solve2(x-7);	
	}else if(able(x-9)){
		string s[9]={
			  ".aa.aa.aa",
			  "b..b..b..",
			  "b..b..b..",
			  
			  ".aa.aa.aa",
			  "b..b..b..",
			  "b..b..b..",

			  ".aa.aa.aa",
			  "b..b..b..",
			  "b..b..b..",};
		REP(i,9)
			REP(j,9){
				ans[i+x-9][j+x-9]=s[i][j];
			}	
		solve2(x-9);
	}else if(x!=0){
		cout << -1 << endl;
		return 0;
	}
	return 1;
}
LL solve(){
	cin >> N;
	if(solve2(N)){
		REP(i,N) {
			string s;
			REP(j,N){
				if(ans[i][j]==0){
					s+='.';
				}else
					s+=ans[i][j];		
			}
			cout << s << endl;
		}
	}

	return NONE;
}
 signed main() {
 
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(10);
	LL T=1;

	REP(i,T){
		DEFAULT;

	}
	
//	YesNo;
//	YESNO;
//	three(solve(),OUT("First"),OUT("Second"));
	//cin >> N;
	return 0;
 
}


Measured memory_bytes: 21120