#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  char m[4][101] = {};
  cin >> n;
  if (n == 1) {
    m[0][0] = m[1][0] = 'a';
    m[2][0] = m[3][0] = 'z';
  } else if (n % 2) {
    for (int i = 0; i < n / 2; i++) {
      m[0][2 * i] = m[0][2 * i + 1] = 'a' + i % 10;
      m[1][2 * i] = m[1][2 * i + 1] = 'z' - i % 10;
    }
    m[0][n - 1] = m[1][n - 1] = 'z' - (n / 2) % 10;
    for (int i = 0; i < n / 2; i++) {
      m[2][2 * i + 1] = m[2][2 * i + 2] = 'b' + i % 10;
      m[3][2 * i + 1] = m[3][2 * i + 2] = 'z' - i % 10;
    }
    m[2][0] = m[3][0] = 'a';
  } else {
    for (int i = 0; i < n / 2; i++) {
      m[0][2 * i] = m[0][2 * i + 1] = 'a' + i % 10;
      m[3][2 * i] = m[3][2 * i + 1] = 'a' + i % 10;
    }
    for (int i = 0; i < n / 2 - 1; i++) {
      m[1][2 * i + 1] = m[1][2 * i + 2] = 'z' - 2 * i % 10 - 1;
      m[2][2 * i + 1] = m[2][2 * i + 2] = 'z' - 2 * i % 10 - 2;
    }
    m[1][0] = m[2][0] = 'z';
    m[1][n - 1] = m[2][n - 1] = 'z' - n % 10;
  }
  for (int i = 0; i < 4; i++) {
    for (int j = 0; j < n; j++) cout << m[i][j];
    cout << endl;
  }
  return 0;
}
