#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 50;
const int maxm = 1e6 + 50;
const double eps = 1e-10;
const int max_index = 62;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
inline int read() {
  char c = getchar();
  while (!isdigit(c)) c = getchar();
  int x = 0;
  while (isdigit(c)) {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return x;
}
char ans[5][105];
int main() {
  int n = read();
  if (n & 1) {
    ans[1][0] = ans[2][0] = 'a';
    char cur = 'b';
    for (int i = 1; i < n; i += 2) {
      ans[1][i] = ans[1][i + 1] = cur++;
      ans[2][i] = ans[2][i + 1] = cur;
      cur++;
      if (cur >= 'x') cur = 'a';
    }
    cur = 'a';
    while (ans[2][n - 1] == cur) cur++;
    ans[3][n - 1] = ans[4][n - 1] = cur;
    for (int i = n - 2; ~i; i -= 2) {
      char cur = 'a';
      while (ans[2][i] == cur || ans[2][i - 1] == cur || ans[3][i + 1] == cur)
        cur++;
      ans[3][i] = ans[3][i - 1] = cur;
      cur = 'a';
      while (ans[3][i] == cur || ans[3][i - 1] == cur || ans[4][i + 1] == cur)
        cur++;
      ans[4][i] = ans[4][i - 1] = cur;
    }
  } else {
    char cur = 'a';
    for (int i = 0; i < n; i += 2) {
      ans[1][i] = ans[1][i + 1] = cur;
      cur++;
      ans[2][i] = ans[2][i + 1] = cur;
      cur++;
      if (cur >= 'x') cur = 'a';
    }
    cur = 'a';
    while (ans[2][0] == cur) cur++;
    ans[3][0] = ans[4][0] = cur;
    for (int i = 1; i < n; i += 2) {
      char cur = 'a';
      while (ans[2][i] == cur || ans[2][i + 1] == cur || ans[3][i - 1] == cur)
        cur++;
      ans[3][i] = ans[3][i + 1] = cur;
      cur = 'a';
      while (ans[3][i] == cur || ans[3][i + 1] == cur || ans[4][i - 1] == cur)
        cur++;
      ans[4][i] = ans[4][i + 1] = cur;
    }
    cur = 'a';
    while (ans[2][n - 1] == cur || ans[3][n - 2] == cur || ans[4][n - 2] == cur)
      cur++;
    ans[3][n - 1] = ans[4][n - 1] = cur;
  }
  for (int i = 1; i <= 4; i++) {
    ans[i][n] = '\0';
    printf("%s", ans[i]);
    puts("");
  }
  return 0;
}
