#include <bits/stdc++.h>
using namespace std;
long long n, i, j, mas[110][4] = {}, r = 0;
char pct(int k) { return (char)k + 96; }
int main() {
  cin >> n;
  if (n == -1)
    cout << "-1" << endl;
  else {
    i = 0;
    while (i < n) {
      if ((n - i) >= 2) {
        mas[i][0] = r % 10 + 1;
        mas[i + 1][0] = r % 10 + 1;
        r++;
        mas[i][1] = r % 10 + 1;
        mas[i + 1][1] = r % 10 + 1;
        r++;
        i += 2;
      } else {
        mas[i][0] = r % 10 + 1;
        mas[i][1] = r % 10 + 1;
        r++;
        i++;
      }
    }
    i = 1;
    mas[0][2] = r % 10 + 11;
    mas[0][3] = r % 10 + 11;
    r++;
    while (i < n) {
      if ((n - i) >= 2) {
        mas[i][2] = r % 10 + 11;
        mas[i + 1][2] = r % 10 + 11;
        r++;
        mas[i][3] = r % 10 + 11;
        mas[i + 1][3] = r % 10 + 11;
        r++;
        i += 2;
      } else {
        mas[i][2] = r % 10 + 11;
        mas[i][3] = r % 10 + 11;
        r++;
        i++;
      }
    }
  }
  for (i = 0; i < 4; i++) {
    for (j = 0; j < n; j++) cout << pct(mas[j][i]);
    cout << endl;
  }
  return 0;
}
