#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vvl A = VVL(N + 1, N + 1, '.');

  vector<string> s4(4);
  s4[0] = "aabc";
  s4[1] = "ddbc";
  s4[2] = "bcaa";
  s4[3] = "bcdd";
  vector<string> s5(5);
  s5[0] = "aabba";
  s5[1] = "bcc.a";
  s5[2] = "b..cb";
  s5[3] = "a..cb";
  s5[4] = "abbaa";
  vector<string> s6(6);
  s6[0] = "aabc..";
  s6[1] = "ddbc..";
  s6[2] = "..aabc";
  s6[3] = "..ddbc";
  s6[4] = "bc..aa";
  s6[5] = "bc..dd";
  vector<string> s7(7);
  s7[0] = "aabbcc.";
  s7[1] = "dd.dd.a";
  s7[2] = "..d..da";
  s7[3] = "..d..db";
  s7[4] = "dd.dd.b";
  s7[5] = "..d..dc";
  s7[6] = "..d..dc";

  if (N == 2) {
    cout << -1 << endl;
    return 0;
  } else if (N == 3) {
    REP(i, N) REP(j, N) {
      if (i % 3 == 0 && j % 3 == 0 && i / 3 == j / 3)
        A[i][j] = 'a';
      if (i % 3 == 0 && j % 3 == 1 && i / 3 == j / 3)
        A[i][j] = 'a';
      if (i % 3 == 1 && j % 3 == 2 && i / 3 == j / 3)
        A[i][j] = 'a';
      if (i % 3 == 2 && j % 3 == 2 && i / 3 == j / 3)
        A[i][j] = 'a';
    }

  } else {
    ll po = (N / 4) - 1;
    REP(i, po) { REP(k1, 4) REP(k2, 4) A[i * 4 + k1][i * 4 + k2] = s4[k1][k2]; }
    if (N % 4 == 0) {
      REP(k1, 4) REP(k2, 4) A[po * 4 + k1][po * 4 + k2] = s4[k1][k2];
    } else if (N % 4 == 1) {
      REP(k1, 5) REP(k2, 5) A[po * 4 + k1][po * 4 + k2] = s5[k1][k2];
    } else if (N % 4 == 2) {
      REP(k1, 6) REP(k2, 6) A[po * 4 + k1][po * 4 + k2] = s6[k1][k2];
    } else {
      REP(k1, 7) REP(k2, 7) A[po * 4 + k1][po * 4 + k2] = s7[k1][k2];
    }
  }
  REP(i, N) {
    REP(j, N) { cout << (char)(A[i][j]) << ""; }
    cout << endl;
  }

  return 0;
}


Measured memory_bytes: 9088