#include <bits/stdc++.h>
int n;
char g[5][555];
int main() {
  scanf("%d", &n);
  if (n % 2 == 1) {
    g[0][0] = g[1][0] = 'a';
    for (int i = 1; i < n; i += 2) {
      g[0][i] = g[0][i + 1] = 'a' + i % 26;
      g[1][i] = g[1][i + 1] = 'a' + (i + 1) % 26;
    }
    for (int i = 0; i < n - 1; i += 2) {
      g[2][i] = g[2][i + 1] = 'a' + (i + 3) % 26;
      g[3][i] = g[3][i + 1] = 'a' + (i + 4) % 26;
    }
    char c = 'b';
    while (c == g[1][n - 1] || c == g[2][n - 2] || c == g[3][n - 2]) {
      c++;
      if (c == 'z') c = 'a';
    }
    g[2][n - 1] = g[3][n - 1] = c;
  } else {
    g[0][0] = g[1][0] = 'a';
    for (int i = 1; i < n - 1; i += 2) {
      g[0][i] = g[0][i + 1] = 'a' + i % 26;
      g[1][i] = g[1][i + 1] = 'a' + (i + 1) % 26;
    }
    g[0][n - 1] = g[1][n - 1] = 'a' + n % 26;
    for (int i = 0; i < n; i += 2) {
      g[2][i] = g[2][i + 1] = 'a' + (i + 10) % 26;
      g[3][i] = g[3][i + 1] = 'a' + (i + 11) % 26;
    }
  }
  for (int i = 0; i < 4; i++) {
    for (int j = 0; j < n; j++) printf("%c", g[i][j]);
    printf("\n");
  }
  return 0;
}
