#include <bits/stdc++.h>
using namespace std;
int p[4][1000];
char ans[100000];
int cl = 0;
int n;
bool check(int i, int j) {
  if ((i >= 0) && (i < 4))
    if ((j >= 0) && (j < n)) return true;
  return false;
}
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
bool bad(int x, int y) {
  for (int i = 0; i < (int)4; i++)
    if (check(x + dx[i], y + dy[i]))
      if (ans[p[x + dx[i]][y + dx[y]]] == ans[p[x][y]] &&
          p[x + dx[i]][y + dy[i]] != p[x][y])
        return false;
  return true;
}
int main() {
  scanf("%d ", &n);
  if (n % 2 == 0) {
    for (int i = 0; i < (int)n / 2; i++) {
      p[0][i * 2 + 1] = p[0][i * 2] = cl++;
      p[3][i * 2 + 1] = p[3][i * 2] = cl++;
    }
    for (int i = 0; i < (int)n / 2 - 1; i++) {
      p[1][i * 2 + 2] = p[1][i * 2 + 1] = cl++;
      p[2][i * 2 + 2] = p[2][i * 2 + 1] = cl++;
    }
    p[1][0] = p[2][0] = cl++;
    p[1][n - 1] = p[2][n - 1] = cl++;
  } else {
    for (int i = 0; i < (int)n / 2; i++) {
      p[0][i * 2 + 1] = p[0][i * 2] = cl++;
      p[1][i * 2 + 1] = p[1][i * 2] = cl++;
      p[2][i * 2 + 2] = p[2][i * 2 + 1] = cl++;
      p[3][i * 2 + 2] = p[3][i * 2 + 1] = cl++;
    }
    p[0][n - 1] = p[1][n - 1] = cl++;
    p[2][0] = p[3][0] = cl++;
  }
  bool fl = true;
  for (int i = 0; i < (int)4; i++)
    for (int j = 0; j < (int)n; j++) ans[p[i][j]] = (i * 239 + j) % 26;
  for (int i = 0; i < (int)4; i++) {
    for (int j = 0; j < (int)n; j++) printf("%c", ans[p[i][j]] + 'a');
    puts("");
  }
  return 0;
}
