#include <bits/stdc++.h>

#include <unistd.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
 
 
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
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 (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
int dx_ori[4] = { -1,0, 1,0 }, dy_ori[4] = { 0,1,0,-1 };
int dx[4] = {0, 0, 0, 0}, dy[4] = {0, 0, 0, 0};
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'


int n;
void solve3(vector<string> three) {
  vector<vector<char>> ans(n, vector<char>(n, '.'));
  for (int i = 0; i < n; i += 3) {
    rep (j, 3) rep (k, 3) {
      ans[i + j][i + k] = three[j][k];
    }
  }

  rep (i, n) {
    rep (j, n) {
      cout << ans[i][j];
    }
    cout << endl;
  }
  return;
}

void solve(int n4, int n5, vector<string> four, vector<string> five) {
  DEBUG(pii(n4, n5));
  int i = 0;
  vector<vector<char>> ans(n, vector<char>(n, '.'));
  rep (_, n4) {
    rep (j, 4) rep (k, 4) {
      ans[i + j][i + k] = four[j][k];
    }
    i += 4;
  }
  
  rep (_, n5) {
    rep (j, 5) rep (k, 5) {
      ans[i + j][i + k] = five[j][k];
    }
    i += 5;
  }

  
  rep (i, n) {
    rep (j, n) {
      cout << ans[i][j];
    }
    cout << endl;
  }
  return;
}

signed main() {
  fio();
  cin >> n;
  if (n == 1 or n == 2) {
    cout << -1 << endl;
    return 0;
  }

  vector<string> three(3, string(3, '.'));
  three[0][0] = three[1][0] = 'a';
  three[2][1] = three[2][2] = 'b';

  if (n % 3 == 0) {
    solve3(three);
    return 0;
  }

  if (n == 7) {
    vector<string> ans(7);
    ans = {
      "ab...b.", "ab...b.", "..cca.c", "..dda.c", "aa..dee", "..bbd.f", "cc..ggf"
    };

    rep (i, n) {
      rep (j, n) {
        cout << ans[i][j];
      }
      cout << endl;
    }
    
    return 0;
  }

  vector<string> four(4, string(4, '.'));

  four = {
    "abcc", "abdd", "ccab", "ddab"
  };
  
  vector<string> five(5, string(5, '.'));
  five = {
    "accdd", "ae..g", "be..g", "b.ffh", "iijjh"
  };
  
  for (int n4 = 0; n4 * 4 <= n; n4++) {
    int m = n - n4 * 4;
    if (m % 5 == 0) {
      solve(n4, m / 5, four, five);
      return 0;
    }
  }

  assert(n == 11);
  vector<string> six(6, string(6, '.'));
  six = {
    "abc...", "abc...", "ddeeff", "gghhii", "...abc", "...abc"
  };
  vector<vector<char>> ans(11, vector<char>(11, '.'));
  rep (i, 5) rep (j, 5) {
    ans[i][j] = five[i][j];
  }
  rep (i, 6) rep (j, 6) {
    ans[5 + i][5 + j] = six[i][j];
  }
  rep (i, n) {
    rep (j, n) {
      cout << ans[i][j];
    }
    cout << endl;
  }
}


Measured memory_bytes: 2304