#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//
const ll MOD = 1e9 + 7;
/*/
const ll MOD = 998244353;
//*/
const ll INF = 1e+18;
const ld EPS = 1e-12L;
const ld PI = acos(-1.L);
inline ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
inline ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
inline bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
inline bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

string a[4] = {
  "abcc",
  "abdd",
  "ccab",
  "ddab"
};
string b[5] = {
  "abbcc",
  "a.dde",
  "xp..e",
  "xp..a",
  "yyzza"
};
string c[6] = {
  "aabb.e",
  "b..zze",
  "bat...",
  ".at.aa",
  "..aggb",
  "nna..b"
};
string d[7] = {
  "aabb..a",
  "b..zz.a",
  "ba....r",
  ".a..aar",
  "..a..bw",
  "..a..bw",
  "uuiioo."
};

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  ll n;
  cin >> n;
  if(n==2){
    print(-1);
    return 0;
  }
  if(n==3){
    print(".aa");
    print("a..");
    print("a..");
    return 0;
  }
  vs ans(n, string(n, '.'));
  ll m = n-4-n%4;
  switch(n%4){
  case 0:
    repr(i, m, n)repr(j, m, n){
      ans[i][j] = a[i-m][j-m];
    }
    break;
  case 1:
    repr(i, m, n)repr(j, m, n){
      ans[i][j] = b[i-m][j-m];
    }
    break;
  case 2:
    repr(i, m, n)repr(j, m, n){
      ans[i][j] = c[i-m][j-m];
    }
    break;
  case 3:
    repr(i, m, n)repr(j, m, n){
      ans[i][j] = d[i-m][j-m];
    }
    break;
  }
  for(int p = 0; p < m; p += 4){
    rep(i, 4)rep(j, 4){
      ans[p+i][p+j] = a[i][j];
    }
  }
  rep(i, n) print(ans[i]);
}


Measured memory_bytes: 2304