#include <bits/stdc++.h>
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> i) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FORA(i, n) for (auto &&i : n)
using namespace std;
#define DUMPOUT cerr
// vector
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}
// pair
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
// vector
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "{";
  REP(i, (int)vec.size())
  os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
  os << "}";
  return os;
}
// map
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "{";
  FORA(itr, map_var) {
    os << *itr;
    itr++;
    if (itr != map_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
// set
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "{";
  FORA(itr, set_var) {
    os << *itr;
    itr++;
    if (itr != set_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) > 0) DUMPOUT << ", ";
  dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define DUMP(...)                                                             \
  DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                             \
          << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
          << "    ",                                                          \
      dump_func(__VA_ARGS__)
#define PRINTARR(x, y)                                     \
  cerr << #x << "=\n";                                     \
  for (auto itr = x; itr != y; itr++) cerr << *itr << " "; \
  cerr << endl;
#define PRINTARR2(x, i0, i1)                                       \
  cerr << #x << "=\n";                                             \
  for (int ii0 = 0; ii0 < i0; ii0++) {                             \
    for (int ii1 = 0; ii1 < i1; ii1++) cerr << x[ii0][ii1] << " "; \
    cerr << endl;                                                  \
  }
#else
#define DEB if (false)
#define DUMP(...)
#define PRINTARR(x, y)
#define PRINTARR2(x, i0, i1)
#endif
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair<int, int>
#define ld long double
using namespace std;
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;
}
template <class T> using vec = std::vector<T>;
template <class T> void print(const T &x) { cout << x << "\n"; }
const int MOD = 1000000007, INF0 = 1061109567, INF = INF0 * INF0;
const double EPS = 1e-10, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
/*
[&] { return; }();下のスラッシュを2つ追加しただけ.上のスラッシュを2つにすれば外れる.
//*/
#define MAXN 1010
char c[MAXN][MAXN];
signed main() {
  cin.tie(0), ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  int N;
  cin >> N;
  fill((char *)c, (char *)c[N], '.');
  if (N % 2 == 0) {
    if (N == 2) {
      print(-1);
      return 0;
    }
    int M = N / 2;
    REP(i, M) {
      int v0 = 2 * i;
      int v1 = 2 * i + 1;
      c[v0][v0] = 'c';
      c[v1][v0] = 'c';
      c[v0][v1] = 'd';
      c[v1][v1] = 'd';
    }
    REP(i, M) {
      int v0 = 2 * i;
      int v1 = 2 * i + 1;
      c[v0][(v0 + 2) % N] = 'a';
      c[v0][(v1 + 2) % N] = 'a';
      c[v1][(v0 + 2) % N] = 'b';
      c[v1][(v1 + 2) % N] = 'b';
    }
  } else {
    if (N == 3) {
      c[0][0] = 'a', c[0][1] = 'a', c[0][2] = 'b';
      c[1][0] = 'c', c[1][1] = '.', c[1][2] = 'b';
      c[2][0] = 'c', c[2][1] = 'd', c[2][2] = 'd';
    } else {
      if (N != 7) {
        string S[5] = {".abcc", "bab..", "b.eef", "cch.f", "ddhgg"};
        REP(i, 5) REP(j, 5) c[i][j] = S[i][j];

        int M = (N - 5) / 2;
        FOR(i, 2, 2 + M) {
          int v0 = 2 * i + 1;
          int v1 = 2 * i + 2;
          c[v0][v0] = 'c';
          c[v1][v0] = 'c';
          c[v0][v1] = 'd';
          c[v1][v1] = 'd';
        }
        FOR(i, 2, 2 + M) {
          int v0 = 2 * i + 1;
          int v1 = 2 * i + 2;
          int addr0 = v0 + 2;
          int addr1 = v1 + 2;
          if (addr0 >= N) addr0 -= N, addr0 += 5;
          if (addr1 >= N) addr1 -= N, addr1 += 5;
          c[v0][addr0] = 'a';
          c[v0][addr1] = 'a';
          c[v1][addr0] = 'b';
          c[v1][addr1] = 'b';
        }
      } else {
        string S[7] = {"aac..aa", "b.c..b.", "bdd..b.", "..bxx.c", "..byy.c", "aa...zw", "...cczw"};
        REP(i, 7) { REP(j, 7) c[i][j] = S[i][j]; }
      }
    }
  }
  REP(i, N) {
    REP(j, N) { cout << c[i][j]; }
    cout << "\n";
  }

  // dPRINTARR2(c, N, N);
}

Measured memory_bytes: 2176