#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1LL<<60;
double pi=3.141592653589793238462643383279L;
double eps=1e-10;
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(int i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n;cin>>n;
    int m=n;
    if(n==2){
        cout<<-1<<endl;
        return 0;
    }
    int a[3][3]={{0,0,1},{3,-1,1},{3,2,2}};
    int b[4][4]={{0,0,1,2},{7,7,1,2},{5,6,3,3},{5,6,4,4}};
    int c[5][5]={{0,0,1,1,2},{7,8,8,-1,2},{7,-1,-1,9,3},{6,-1,-1,9,3},{6,5,5,4,4}};
    int d[7][7]
    ={{0,0,1,1,2,2,-1},{6,6,7,-1,-1,-1,3},{9,-1,7,-1,-1,-1,3},{9,8,8,-1,-1,-1,4},
        {-1,-1,-1,6,6,7,4},{-1,-1,-1,9,-1,7,5},{-1,-1,-1,9,8,8,5}
    };
    int ans[n][n];
    rep(i,0,n)rep(j,0,n)ans[i][j]=-1;
    int now=0;
    while(n>=11){
        rep(i,now,now+4){
            rep(j,now,now+4){
                ans[i][j]=b[i-now][j-now];
            }
        }
        now+=4;
        n-=4;
    }
    if(n==3){
        rep(i,0,n)rep(j,0,n)ans[i][j]=a[i][j];
    }
    else if(n==4){
        rep(i,0,n)rep(j,0,n)ans[i][j]=b[i][j];
    }
    else if(n==5){
        rep(i,0,n)rep(j,0,n)ans[i][j]=c[i][j];
    }
    else if(n==6){
        rep(i,0,3)rep(j,0,3)ans[i][j]=a[i][j];
        rep(i,3,6)rep(j,3,6)ans[i][j]=a[i-3][j-3];
    }
    else if(n==7){
        rep(i,now,now+7)rep(j,now,now+7)ans[i][j]=d[i-now][j-now];
    }
    else if(n==8){
        rep(i,now,now+4)rep(j,now,now+4)ans[i][j]=b[i-now][j-now];
        now+=4;
        rep(i,now,now+4)rep(j,now,now+4)ans[i][j]=b[i-now][j-now];
    }
    else if(n==9){
        rep(i,now,now+4)rep(j,now,now+4)ans[i][j]=b[i-now][j-now];
        now+=4;
        rep(i,now,now+5)rep(j,now,now+5)ans[i][j]=c[i-now][j-now];
    }
    else if(n==10){
        rep(i,now,now+5)rep(j,now,now+5)ans[i][j]=c[i-now][j-now];
        now+=5;
        rep(i,now,now+5)rep(j,now,now+5)ans[i][j]=c[i-now][j-now];
    }
    rep(i,0,m){
        rep(j,0,m){
            if(ans[i][j]==-1)cout<<'.';
            else cout<<(char)(ans[i][j]+'a');
            
        }
        cout<<endl;
    }
    
}


Measured memory_bytes: 5120