#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout<<ans<<endl
#define COYE cout<<"YES"<<endl
#define COYe cout<<"Yes"<<endl
#define COye cout<<"yes"<<endl
#define CONO cout<<"NO"<<endl
#define CONo cout<<"No"<<endl
#define COno cout<<"no"<<endl
#define FORE(i,a) for(auto &i:a)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n)  FFOR(i,1,n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(),(V).end()
#define SORT(V) sort((V).begin(),(V).end())
#define REVERSE(V) reverse((V).begin(),(V).end())
#define EACH(V,i) for(typeof((V).begin()) i=(V).begin();i!=(V).end();++i)
#define equals(a,b) (fabs((a)-(b))<EPS)
#define INF ((1LL<<62)-(1LL<<31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Graph=vector<vector<int>>;
inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T>inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int main(){
  int N;
  cin>>N;
  
  if(N==2){
    co(-1);
  }
  else if(N==3){
    co(".aa");
    co("a..");
    co("a..");
  }
  else{
    char C[N][N];
    REP(i,N){
      REP(j,N) C[i][j]='.';
    }
    
    for(int i=0; i<N/4-1; ++i){
      C[4*i][4*i]='a';
      C[4*i+1][4*i]='a';
      C[4*i+2][4*i]='c';
      C[4*i+3][4*i]='a';
      
      C[4*i][4*i+1]='b';
      C[4*i+1][4*i+1]='b';
      C[4*i+2][4*i+1]='c';
      C[4*i+3][4*i+1]='a';
      
      C[4*i][4*i+2]='a';
      C[4*i+1][4*i+2]='c';
      C[4*i+2][4*i+2]='d';
      C[4*i+3][4*i+2]='d';
      
      C[4*i][4*i+3]='a';
      C[4*i+1][4*i+3]='c';
      C[4*i+2][4*i+3]='a';
      C[4*i+3][4*i+3]='a';
    }
    
    int K=N/4*4-4;
    
    if(N%4==0){
      C[K][K]='a';
      C[K+1][K]='a';
      C[K+2][K]='c';
      C[K+3][K]='a';
      
      C[K][K+1]='b';
      C[K+1][K+1]='b';
      C[K+2][K+1]='c';
      C[K+3][K+1]='a';
      
      C[K][K+2]='a';
      C[K+1][K+2]='c';
      C[K+2][K+2]='d';
      C[K+3][K+2]='d';
      
      C[K][K+3]='a';
      C[K+1][K+3]='c';
      C[K+2][K+3]='a';
      C[K+3][K+3]='a';
    }
    if(N%4==1){
      C[K+2][K]='a';
      C[K+3][K]='b';
      C[K+4][K]='a';
      
      C[K+2][K+1]='a';
      C[K+3][K+1]='b';
      C[K+4][K+1]='a';
      
      C[K][K+2]='a';
      C[K+1][K+2]='a';
      C[K+2][K+2]='c';
      C[K+3][K+2]='c';
      C[K+4][K+2]='d';
      
      C[K][K+3]='b';
      C[K+1][K+3]='b';
      C[K+2][K+3]='d';
      C[K+4][K+3]='d';
      
      C[K][K+4]='a';
      C[K+1][K+4]='a';
      C[K+2][K+4]='d';
      C[K+3][K+4]='c';
      C[K+4][K+4]='c';
    }
    if(N%4==2){
      C[K][K]='a';
      C[K+1][K]='a';
      C[K+2][K]='c';
      C[K+3][K]='d';
      
      C[K][K+1]='b';
      C[K+1][K+1]='b';
      C[K+2][K+1]='c';
      C[K+3][K+1]='d';
      
      C[K+2][K+2]='a';
      C[K+3][K+2]='a';
      C[K+4][K+2]='c';
      C[K+5][K+2]='d';
      
      C[K+2][K+3]='b';
      C[K+3][K+3]='b';
      C[K+4][K+3]='c';
      C[K+5][K+3]='d';
      
      C[K][K+4]='c';
      C[K+1][K+4]='d';
      C[K+4][K+4]='a';
      C[K+5][K+4]='a';
      
      C[K][K+5]='c';
      C[K+1][K+5]='d';
      C[K+4][K+5]='b';
      C[K+5][K+5]='b';
    }
    if(N%4==3){
      C[K+4][K]='a';
      C[K+5][K]='b';
      C[K+6][K]='a';
      
      C[K+4][K+1]='a';
      C[K+5][K+1]='b';
      C[K+6][K+1]='a';
      
      C[K+4][K+2]='b';
      C[K+5][K+2]='a';
      C[K+6][K+2]='b';
      
      C[K+4][K+3]='b';
      C[K+5][K+3]='a';
      C[K+6][K+3]='b';
      
      C[K][K+4]='a';
      C[K+1][K+4]='a';
      C[K+2][K+4]='b';
      C[K+3][K+4]='b';
      C[K+6][K+4]='c';
      
      C[K][K+5]='b';
      C[K+1][K+5]='b';
      C[K+2][K+5]='a';
      C[K+3][K+5]='a';
      C[K+6][K+5]='c';
      
      C[K][K+6]='a';
      C[K+1][K+6]='a';
      C[K+2][K+6]='b';
      C[K+3][K+6]='b';
      C[K+4][K+6]='c';
      C[K+5][K+6]='c';
    }
    
    REP(i,N){
      REP(j,N) cout<<C[i][j];
      cout<<endl;
    }
  }
  return 0;
}

Measured memory_bytes: 2176