#include <bits/stdc++.h>
using namespace std;
int n;
char ma[4][200];
int cont;
char a = 0;
void igual() {
  for (int i = 0; i < 2; ++i) {
    for (int j = 0; j < n - 1;) {
      if (i) {
        if (ma[i - 1][j] == a) a = (a + 1) % 26;
        if (ma[i - 1][j + 1] == a) a = (a + 1) % 26;
      }
      ma[i][j] = ma[i][j + 1] = a;
      a = (a + 1) % 26;
      j += 2;
    }
  }
  for (int i = 2; i < 4; ++i) {
    for (int j = 1; j < n - 1;) {
      if (ma[i - 1][j] == a) a = (a + 1) % 26;
      if (ma[i - 1][j + 1] == a) a = (a + 1) % 26;
      ma[i][j] = ma[i][j + 1] = a;
      a = (a + 1) % 26;
      j += 2;
    }
  }
  if (ma[1][0] == a) a = (a + 1) % 26;
  if (ma[2][1] == a) a = (a + 1) % 26;
  if (ma[3][1] == a) a = (a + 1) % 26;
  ma[2][0] = ma[3][0] = a;
  a = (a + 1) % 26;
}
int main() {
  scanf("%d", &n);
  if (n == 1)
    printf("a\na\nb\nb\n");
  else if (n == 2)
    printf("aa\nbb\ncc\ndd\n");
  else {
    if (n & 1) {
      memset(ma, -1, sizeof(ma));
      igual();
      if (ma[0][n - 2] == a) a = (a + 1) % 26;
      if (ma[1][n - 2] == a) a = (a + 1) % 26;
      if (ma[2][n - 1] == a) a = (a + 1) % 26;
      ma[0][n - 1] = ma[1][n - 1] = a;
      a = (a + 1) % 26;
    } else {
      igual();
      if (ma[1][n - 1] == a) a = (a + 1) % 26;
      if (ma[2][n - 2] == a) a = (a + 1) % 26;
      if (ma[3][n - 2] == a) a = (a + 1) % 26;
      ma[2][n - 1] = ma[3][n - 1] = a;
      a = (a + 1) % 26;
    }
    for (int i = 0; i < 4; ++i) {
      for (int j = 0; j < n; ++j) printf("%c", ma[i][j] + 'a');
      printf("\n");
    }
  }
}
