#include <bits/stdc++.h>
using namespace std;
int n;
char res[4][105];
int main() {
  int i, now;
  scanf("%d", &n);
  memset(res, 0, sizeof res);
  if (n % 2 == 1) {
    res[0][0] = res[1][0] = 0;
    res[2][n - 1] = res[3][n - 1] = 13;
    for (i = 1, now = 0; i < n; i += 2, now += 2) {
      now = now % 4;
      res[0][i] = res[0][i + 1] = now + 1;
      res[1][i] = res[1][i + 1] = now + 2;
      res[2][i - 1] = res[2][i] = now + 14;
      res[3][i - 1] = res[3][i] = now + 15;
    }
  } else if (n == 2) {
    for (i = 0, now = 0; i < n; i += 2, now += 2) {
      now = now % 4;
      res[0][i] = res[0][i + 1] = now + 1;
      res[1][i] = res[1][i + 1] = now + 2;
      res[2][i] = res[2][i + 1] = now + 14;
      res[3][i] = res[3][i + 1] = now + 15;
    }
  } else {
    for (i = 0, now = 0; i < n; i += 2, now += 2) {
      now = now % 4;
      res[0][i] = res[0][i + 1] = now + 1;
      res[1][i] = res[1][i + 1] = now + 2;
      res[2][i + 1] = res[2][i + 2] = now + 14;
      res[3][i + 1] = res[3][i + 2] = now + 15;
    }
    res[2][0] = res[3][0] = 0;
    res[2][n - 1] = res[3][n - 1] = 13;
  }
  for (i = 0; i < 4; i++)
    for (int j = 0; j < n; j++) res[i][j] += 'a';
  for (i = 0; i < 4; i++) {
    for (int j = 0; j < n; j++) printf("%c", res[i][j]);
    printf("\n");
  }
  return 0;
}
