#include <bits/stdc++.h>
using namespace std;
int T, m, n, q, w, mi, ma, cnt, s, t, fi, cc, e, r, z, x;
char a[110][110];
int main() {
  memset(a, 0, sizeof(a));
  scanf("%d", &m);
  if (m == 1) {
    printf("a\na\nb\nb\n");
    return 0;
  }
  if (m % 2 == 0) {
    q = 0;
    for (int i = 0; i < m / 2; i++) {
      a[0][i * 2] = 'a' + q;
      a[0][i * 2 + 1] = 'a' + q;
      q = (q + 1) % 2;
    }
    q = 0;
    for (int i = 1; i < 3; i++) {
      a[i][0] = 'c' + q;
      a[i][m - 1] = 'e' + q;
    }
    q = 0;
    w = 0;
    for (int i = 1; i < 3; i++) {
      for (int j = 1; j < m - 1; j++) {
        a[i][j] = 'g' + q + w;
        if (j % 2 == 0) w = (w + 1) % 2;
      }
      q = (q + 2);
    }
    q = 0;
    for (int i = 0; i < m / 2; i++) {
      a[3][i * 2] = 'y' + q;
      a[3][i * 2 + 1] = 'y' + q;
      q = (q + 1) % 2;
    }
  } else {
    a[0][0] = 'a';
    a[1][0] = 'a';
    q = 0;
    w = 0;
    for (int i = 0; i < 2; i++) {
      for (int j = 1; j < m; j++) {
        a[i][j] = 'c' + q + w;
        if (j % 2 == 0) w = (w + 1) % 2;
      }
      if (i % 2 == 0) q = (q + 2) % 4;
    }
    q = 0;
    w = 0;
    for (int i = 2; i < 4; i++) {
      for (int j = 0; j < m - 1; j++) {
        a[i][j] = 'i' + q + w;
        if (j % 2 == 1) w = (w + 1) % 2;
      }
      if (i % 2 == 0) q = (q + 2) % 4;
    }
    a[2][m - 1] = 'z';
    a[3][m - 1] = 'z';
  }
  for (int i = 0; i < 4; i++) puts(a[i]);
  return 0;
}
