#include <bits/stdc++.h>
using namespace std;
int N, K;
char ptr[5][1 << 10];
int main() {
  scanf("%d", &N);
  for (int i = 0; i < 4; i++) ptr[i][N] = 0;
  if (N % 2 == 0) {
    for (int i = 0; i < N; i += 2)
      ptr[3][i] = ptr[3][i + 1] = ptr[0][i] = ptr[0][i + 1] = 'a' + i % 4;
    ptr[1][0] = ptr[2][0] = 'z';
    ptr[1][N - 1] = ptr[2][N - 1] = 'y';
    for (int i = 1; i < N - 1; i += 2) ptr[1][i] = ptr[1][i + 1] = 'g' + i % 4;
    for (int i = 1; i < N - 1; i += 2) ptr[2][i] = ptr[2][i + 1] = 't' + i % 4;
  } else {
    ptr[0][0] = ptr[1][0] = 'z';
    for (int i = 1; i < N; i += 2) ptr[0][i] = ptr[0][i + 1] = 'f' + i % 4;
    for (int i = 1; i < N; i += 2) ptr[1][i] = ptr[1][i + 1] = 'q' + i % 4;
    for (int i = 0; i + 1 < N; i += 2) ptr[2][i] = ptr[2][i + 1] = 'f' + i % 4;
    for (int i = 0; i + 1 < N; i += 2) ptr[3][i] = ptr[3][i + 1] = 'q' + i % 4;
    ptr[2][N - 1] = ptr[3][N - 1] = 'y';
  }
  for (int i = 0; i < 4; i++) cout << ptr[i] << endl;
  return 0;
}
