#include <bits/stdc++.h>
using namespace std;
bool u[100][1 << 4];
char s[4][101];
void rec(int c, int r, int n, int mask, int newmask) {
  if (r == 4) {
    rec(c + 1, 0, n, newmask, 0);
    return;
  }
  if (c == n) {
    if (mask) return;
    for (int i = 0; i < 4; i++) puts(s[i]);
    exit(0);
  }
  if (c > 0 && mask == 0) return;
  if (r == 0) {
    if (u[c][mask]) return;
    u[c][mask] = true;
  }
  if (mask & (1 << r)) {
    s[r][c] = s[r][c - 1];
    rec(c, r + 1, n, mask, newmask);
  } else {
    bool u[26] = {0};
    for (int j = 0; j < 4; j++) {
      if (c) u[s[j][c - 1] - 'a'] = true;
      if (j) u[s[j - 1][c] - 'a'] = true;
    }
    char ch;
    for (ch = 0; ch < 26; ch++)
      if (!u[ch]) break;
    ch += 'a';
    if (r < 3 && !(mask & (1 << r + 1))) {
      s[r][c] = s[r + 1][c] = ch;
      rec(c, r + 2, n, mask, newmask);
    }
    s[r][c] = ch;
    rec(c, r + 1, n, mask, newmask | (1 << r));
  }
}
int main() {
  int n;
  cin >> n;
  rec(0, 0, n, 0, 0);
  puts("-1");
  return 0;
}
