#include <bits/stdc++.h>
using namespace std;
const int MAXN = 110;
char s[4][MAXN];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0, j = 0; i + 1 < n; i += 2) {
    s[0][i] = s[0][i + 1] = 'a' + j;
    s[1][i] = s[1][i + 1] = 'c' + j;
    j = j + 1 & 1;
  }
  if (n % 2 == 1)
    s[0][n - 1] = s[1][n - 1] = 'x';
  else
    s[2][n - 1] = s[3][n - 1] = 'y';
  s[2][0] = s[3][0] = 'z';
  for (int i = 1, j = 0; i + 1 < n; i += 2) {
    s[2][i] = s[2][i + 1] = 'e' + j;
    s[3][i] = s[3][i + 1] = 'g' + j;
    j = j + 1 & 1;
  }
  for (int i = 0; i < 4; i++) puts(s[i]);
  return 0;
}
