#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
int n;
int a[4][100];
int main() {
  scanf("%d", &n);
  bool top = true;
  a[0][2] = a[0][3] = 0;
  int cur = 1;
  for (int i = (0); i < (n - 1); i++) {
    if (top) {
      a[0][i] = a[0][i + 1] = cur;
      cur++;
      a[1][i] = a[1][i + 1] = cur;
      cur++;
    } else {
      a[2][i] = a[2][i + 1] = cur;
      cur++;
      a[3][i] = a[3][i + 1] = cur;
      cur++;
    }
    top = !top;
  }
  if (top) {
    a[0][n - 1] = a[1][n - 1] = cur;
  } else {
    a[2][n - 1] = a[3][n - 1] = cur;
  }
  for (int i = (0); i < (4); i++) {
    for (int j = (0); j < (n); j++) {
      printf("%c", (char)(a[i][j] % 26 + 'a'));
    }
    printf("\n");
  }
  return 0;
}
