#include <bits/stdc++.h>
using namespace std;
char ch[128][128];
char to(char c) {
  int t = (c - 'a' + 13) % 26;
  return (char)(t + 'a');
}
int main(void) {
  int n;
  cin >> n;
  while (n <= 100) {
    if (n == 1) {
      cout << "a" << endl;
      cout << "a" << endl;
      cout << "b" << endl;
      cout << "b" << endl;
      return 0;
    }
    for (int i = 0; i < 4; i++) ch[i][n] = 0;
    if (n & 1) {
      for (int i = 0; i < n - 1; i += 2) {
        ch[0][i] = ch[0][i + 1] = 'a' + (i / 2) % 26;
        ch[1][i] = ch[1][i + 1] = to(ch[0][i]);
        ch[2][i + 1] = ch[2][i + 2] = ch[0][i];
        ch[3][i + 1] = ch[3][i + 2] = ch[1][i];
      }
      for (char i = 'a'; i <= 'z'; i++) {
        if (i != ch[0][n - 2] && i != ch[2][n - 1] && i != ch[1][n - 2]) {
          ch[0][n - 1] = i;
          ch[1][n - 1] = i;
          break;
        }
      }
      for (char i = 'a'; i <= 'z'; i++) {
        if (i != ch[1][0] && i != ch[2][1] && i != ch[3][1]) {
          ch[2][0] = i;
          ch[3][0] = i;
          break;
        }
      }
    } else {
      for (int i = 0; i < n; i += 2) {
        ch[0][i] = ch[0][i + 1] = 'a' + (i / 2) % 26;
        if (i + 2 < n) {
          ch[1][i + 1] = ch[1][i + 2] = to(ch[0][i]);
          ch[2][i + 1] = ch[2][i + 2] = ch[0][i];
        }
        ch[3][i] = ch[3][i + 1] = to(ch[0][i]);
      }
      for (char i = 'a'; i <= 'z'; i++) {
        if (i != ch[0][0] && i != ch[3][0] && i != ch[1][1] && i != ch[2][1]) {
          ch[1][0] = ch[2][0] = i;
          break;
        }
      }
      for (char i = 'a'; i <= 'z'; i++) {
        if (i != ch[0][n - 1] && i != ch[3][n - 1] && i != ch[1][n - 2] &&
            i != ch[2][n - 2]) {
          ch[1][n - 1] = i;
          ch[2][n - 1] = i;
          break;
        }
      }
    }
    for (int i = 0; i < 4; i++) puts(ch[i]);
    break;
    int dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
    for (int i = 0; i < 4; i++) {
      for (int j = 0; j < n; j++) {
        int t = 0;
        for (int k = 0; k < 4; k++) {
          int x = i + dir[k][0];
          int y = j + dir[k][1];
          if (x < 0 || x >= 4) continue;
          if (y < 0 || y >= n) continue;
          if (ch[i][j] == ch[x][y]) ++t;
        }
        if (t != 1) cout << "error" << endl;
      }
    }
  }
  return 0;
}
