#include <bits/stdc++.h>
using namespace std;
char ch[5][200];
int n;
int dir[4][2] = {0, 1, 1, 0, 0, -1, -1, 0};
inline bool ill(int i, int j) { return i >= 1 && i <= 4 && j >= 1 && j <= n; }
int main() {
  while (scanf("%d", &n) != EOF) {
    if (n == 1) {
      printf("a\na\nb\nb\n");
      continue;
    } else if (n == 2) {
      puts("aa");
      puts("bb");
      puts("aa");
      puts("bb");
      continue;
    }
    memset(ch, 0, sizeof(ch));
    if (n % 2 == 0) {
      int sss = 0;
      for (int j = 1; j <= n; j += 2) {
        char mm;
        if (sss % 2)
          mm = 'a';
        else
          mm = 'b';
        ch[1][j] = ch[1][j + 1] = mm;
        ch[4][j] = ch[4][j + 1] = mm;
        sss++;
      }
      for (int j = 2; j + 1 <= n; j += 2) {
        char mm;
        if (sss % 2)
          mm = 'c';
        else
          mm = 'd';
        ch[2][j] = ch[2][j + 1] = mm;
        ch[3][j] = ch[3][j + 1] = mm + 4;
        sss++;
      }
      ch[2][1] = ch[3][1] = 'x';
      ch[2][n] = ch[3][n] = 'y';
    } else {
      int sss = 0;
      for (int j = 1; j + 1 <= n; j += 2) {
        char mm;
        if (sss % 2)
          mm = 'a';
        else
          mm = 'b';
        ch[1][j] = ch[1][j + 1] = mm;
        sss++;
      }
      for (int j = n; j - 1 >= 1; j -= 2) {
        char mm;
        if (sss % 2)
          mm = 'c';
        else
          mm = 'd';
        ch[4][j] = ch[4][j - 1] = mm;
        sss++;
      }
      while (true) {
        bool find = false;
        for (int i = 1; i <= 4; i++) {
          for (int j = 1; j <= n; j++) {
            if (ch[i][j]) continue;
            int sum = 0;
            int had[26] = {false};
            int x, y;
            for (int in = 0; in < 4; in++) {
              int t_x = i + dir[in][0];
              int t_y = j + dir[in][1];
              if (!ill(t_x, t_y)) continue;
              if (ch[t_x][t_y]) {
                had[ch[t_x][t_y] - 'a'] = true;
              } else {
                x = t_x, y = t_y;
                sum++;
              }
            }
            if (sum == 1) {
              find = true;
              int sel = 0;
              while (had[sel] == true) sel++;
              ch[i][j] = ch[x][y] = 'a' + sel;
              find = true;
              break;
            }
          }
        }
        if (find == false) break;
      }
    }
    for (int i = 1; i <= 4; i++) {
      for (int j = 1; j <= n; j++) putchar(ch[i][j]);
      puts("");
    }
  }
}
