#include <bits/stdc++.h>
char ans[4][128];
int main() {
  int i, j, n;
  while (scanf("%d", &n) != EOF) {
    memset(ans, 0, sizeof(ans));
    if (n % 2 == 1) {
      j = 0;
      ans[0][0] = 'a' + j;
      ans[1][0] = 'a' + j;
      j = (j + 1) % 26;
      for (i = 0; i < n; i += 2) {
        ans[0][i + 1] = ans[0][i + 2] = 'a' + j;
        j = (j + 1) % 26;
        ans[1][i + 1] = ans[1][i + 2] = 'a' + j;
        j = (j + 1) % 26;
        ans[2][i + 1] = ans[2][i] = 'a' + j;
        j = (j + 1) % 26;
        ans[3][i + 1] = ans[3][i] = 'a' + j;
        j = (j + 1) % 26;
      }
      ans[2][n - 1] = 'a' + j;
      ans[3][n - 1] = 'a' + j;
      ans[0][n] = ans[1][n] = ans[2][n] = ans[3][n] = '\0';
    } else {
      j = 0;
      ans[1][0] = 'a' + j;
      ans[2][0] = 'a' + j;
      j = (j + 1) % 26;
      for (i = 0; i < n; i += 2) {
        ans[1][i + 1] = ans[1][i + 2] = 'a' + j;
        j = (j + 1) % 26;
        ans[2][i + 1] = ans[2][i + 2] = 'a' + j;
        j = (j + 1) % 26;
        ans[0][i + 1] = ans[0][i] = 'a' + j;
        j = (j + 1) % 26;
        ans[3][i + 1] = ans[3][i] = 'a' + j;
        j = (j + 1) % 26;
      }
      ans[1][n - 1] = 'a' + j;
      ans[2][n - 1] = 'a' + j;
      ans[0][n] = ans[1][n] = ans[2][n] = ans[3][n] = '\0';
    }
    puts(ans[0]);
    puts(ans[1]);
    puts(ans[2]);
    puts(ans[3]);
  }
  return 0;
}
