#pragma target("avx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;

#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

//------ Believe yourself as a genius!!!!!! ------

int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
ll n, cnt, tmp, m, h, w, x, y, sum, k, q;
char ans[2000][2000];

char a[10][10] = {
    "aa.",
    "..a",
    "..a",
};

char b[10][10] = {
    "aabc",
    "ddbc",
    "efgg",
    "efhh",
};

char c[10][10] = {
    "aa.bc", ".ddbc", "eefgg", "h.f.i", "h.jji",
};

char d[10][10] = {
    "..aabc", "dd..bc", "efgg..", "ef..hh", "..ijkk", "llij..",
};

char e[10][10] = {
    "aabb.c.", "d..eec.", "d.e.f..", "..e.fgg", "hhii..j", ".k..l.j", ".k..lmm",
};

int main(void) {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);

  cin >> n;
  if (n == 2) {
    Cout(-1);
    return 0;
  }
  if (n == 3) {
    rep(i, 3) {
      rep(j, 3) { cout << a[i][j]; }
      cout << "\n";
    }
    return 0;
  }

  rep(i, n) rep(j, n) ans[i][j] = '.';
  ll st = 0;
  rep(i, n / 4 - 1) {
    rrep(j, st, st + 4) {
      rrep(k, st, st + 4) { ans[j][k] = b[j % 4][k % 4]; }
    }
    st += 4;
  }
  if (n - st == 4) {
    rrep(j, st, st + 4) {
      rrep(k, st, st + 4) { ans[j][k] = b[j % 4][k % 4]; }
    }
  } else if (n - st == 5) {
    rrep(j, st, st + 5) {
      rrep(k, st, st + 5) { ans[j][k] = c[(j - st) % 5][(k - st) % 5]; }
    }
  } else if (n - st == 6) {
    rrep(j, st, st + 6) {
      rrep(k, st, st + 6) { ans[j][k] = d[(j - st) % 6][(k - st) % 6]; }
    }
  } else if (n - st == 7) {
    rrep(j, st, st + 7) {
      rrep(k, st, st + 7) { ans[j][k] = e[(j - st) % 7][(k - st) % 7]; }
    }
  }

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

Measured memory_bytes: 3200