Problem: Let us consider a grid of squares with N rows and N columns. You want to put some domino pieces on this grid. Each domino piece covers two squares that have a common side. Each square can be covered by at most one piece.

For each row of the grid, let's define its quality as the number of domino pieces that cover at least one square in this row. We define the quality of each column similarly.

Find a way to put at least one domino piece on the grid so that the quality of every row is equal to the quality of every column, or determine that such a placement doesn't exist.

Constraints

* 2 \le N \le 1000

Input

Input is given from Standard Input in the following format:


N


Output

If the required domino placement doesn't exist, print a single integer `-1`.

Otherwise, output your placement as N strings of N characters each. If a square is not covered, the corresponding character must be `.` (a dot). Otherwise, it must contain a lowercase English letter. Squares covered by the same domino piece must contain the same letter. If two squares have a common side but belong to different pieces, they must contain different letters.

Examples

Input

6


Output

aabb..
b..zz.
ba....
.a..aa
..a..b
..a..b


Input

2


Output

-1

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long hxtype;
template<class IT>inline void cmax(IT &a,IT b){if(a<b)a=b;}
template<class IT>inline void cmin(IT &a,IT b){if(b<a)a=b;}
const ll p=998244353ll;
const int N=1005;
char a[N][N];
int main(){
	int n,i,j,m;
	scanf("%d",&n);
	if(n<3)puts("-1");
	else{
		if(n==3){
			puts("aab");
			puts("b.b");
			puts("baa");
		}else if(n==5){
			puts("eefii");
			puts("h.fjj");
			puts("hgg.k");
			puts("nm..k");
			puts("nmll.");
		}else if(n==7){
			puts("aabc...");
			puts("b.bc...");
			puts("baadd..");
			puts("ccd..ee");
			puts("..d.xxy");
			puts("...ey.y");
			puts("...eyxx");
		}else{
			for(i=1;i<=n;++i)for(j=1;j<=n;++j)a[i][j]='.';
			m=(n&1)?n-5:n;
			a[1][  1]=a[1][  2]='a';
			a[2][  1]=a[2][  2]='b';
			a[1][m-1]=a[2][m-1]='c';
			a[1][m  ]=a[2][m  ]='d';
			for(i=3;i<=m;i+=2){
				a[i  ][i  ]=a[i  ][i+1]='a';
				a[i+1][i  ]=a[i+1][i+1]='b';
				a[i  ][i-2]=a[i+1][i-2]='c';
				a[i  ][i-1]=a[i+1][i-1]='d';
			}
			if(n&1){
//				puts("eefii");
//				puts("h.fjj");
//				puts("hgg.k");
//				puts("nm..k");
//				puts("nmll.");
				a[n-4][n-4]='e';a[n-4][n-3]='e';a[n-4][n-2]='f';a[n-4][n-1]='i';a[n-4][n]='i';
				a[n-3][n-4]='h';a[n-3][n-3]='.';a[n-3][n-2]='f';a[n-3][n-1]='j';a[n-3][n]='j';
				a[n-2][n-4]='h';a[n-2][n-3]='g';a[n-2][n-2]='g';a[n-2][n-1]='.';a[n-2][n]='k';
				a[n-1][n-4]='n';a[n-1][n-3]='m';a[n-1][n-2]='.';a[n-1][n-1]='.';a[n-1][n]='k';
				a[n  ][n-4]='n';a[n  ][n-3]='m';a[n  ][n-2]='l';a[n  ][n-1]='l';a[n  ][n]='.';
			}
			for(i=1;i<=n;++i)puts(a[i]+1);
		}
	}
	return 0;
}