#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  char ch = 'a';
  char res[4][101] = {};
  cin >> n;
  if (n % 2 == 0) {
    int i = 0;
    for (i = 0; i < n / 2; i++) {
      res[0][2 * i] = (char)(ch + i % 26);
      res[0][2 * i + 1] = (char)(ch + i % 26);
    }
    i = i % 26;
    if (res[0][0] == (char)(ch + i)) i++;
    res[1][0] = (char)(ch + i % 26);
    res[2][0] = (char)(ch + i % 26);
    int k = 0;
    for (i = 0; i < n / 2 - 1; i++) {
      char ch = 'a';
      k++;
      int fl = 1;
      while (fl) {
        if (res[1][2 * i] == (char)(ch + k % 26) ||
            res[0][2 * i + 1] == (char)(ch + k % 26) ||
            res[0][2 * i + 2] == (char)(ch + k % 26))
          k++;
        else
          fl = 0;
      }
      res[1][2 * i + 1] = (char)(ch + k % 26);
      res[1][2 * i + 2] = (char)(ch + k % 26);
    }
    for (i = 0; i < n / 2 - 1; i++) {
      char ch = 'a';
      k++;
      int fl = 1;
      while (fl) {
        if (res[2][2 * i] == (char)(ch + k % 26) ||
            res[1][2 * i + 1] == (char)(ch + k % 26) ||
            res[1][2 * i + 2] == (char)(ch + k % 26))
          k++;
        else
          fl = 0;
      }
      res[2][2 * i + 1] = (char)(ch + k % 26);
      res[2][2 * i + 2] = (char)(ch + k % 26);
    }
    i = res[1][n - 2];
    while ((char)(ch + i % 26) == res[1][n - 2] ||
           (char)(ch + i % 26) == res[2][n - 2])
      i++;
    res[1][n - 1] = (char)(ch + i % 26);
    res[2][n - 1] = (char)(ch + i % 26);
    k = 0;
    for (i = 0; i < n / 2; i++) {
      char ch = 'a';
      k++;
      int fl = 1;
      while (fl) {
        if (res[2][2 * i] == (char)(ch + k % 26) ||
            res[2][2 * i + 1] == (char)(ch + k % 26))
          k++;
        else
          fl = 0;
      }
      res[3][2 * i] = (char)(ch + k % 26);
      res[3][2 * i + 1] = (char)(ch + k % 26);
    }
  } else {
    int i = 0;
    for (i = 0; i < n / 2; i++) {
      res[0][2 * i] = (char)(ch + i % 26);
      res[0][2 * i + 1] = (char)(ch + i % 26);
    }
    i = i % 26;
    if (res[0][n - 2] == (char)(ch + i)) i++;
    res[0][n - 1] = (char)(ch + i % 26);
    res[1][n - 1] = (char)(ch + i % 26);
    int k = 0;
    for (i = 0; i < n / 2; i++) {
      char ch = 'a';
      k++;
      int fl = 1;
      while (fl) {
        if (res[0][2 * i] == (char)(ch + k % 26) ||
            res[0][2 * i + 1] == (char)(ch + k % 26) ||
            res[0][n - 1] == (char)(ch + k % 26))
          k++;
        else
          fl = 0;
      }
      res[1][2 * i + 1] = (char)(ch + k % 26);
      res[1][2 * i] = (char)(ch + k % 26);
    }
    i = i % 26;
    if (res[1][0] == (char)(ch + i)) i++;
    res[2][0] = (char)(ch + i % 26);
    res[3][0] = (char)(ch + i % 26);
    for (i = 0; i < n / 2; i++) {
      char ch = 'a';
      k++;
      int fl = 1;
      while (fl) {
        if (res[1][2 * i + 1] == (char)(ch + k % 26) ||
            res[1][2 * i + 2] == (char)(ch + k % 26) ||
            res[2][2 * i] == (char)(ch + k % 26))
          k++;
        else
          fl = 0;
      }
      res[2][2 * i + 1] = (char)(ch + k % 26);
      res[2][2 * i + 2] = (char)(ch + k % 26);
    }
    for (i = 0; i < n / 2; i++) {
      char ch = 'a';
      k++;
      int fl = 1;
      while (fl) {
        if (res[2][2 * i + 1] == (char)(ch + k % 26) ||
            res[2][2 * i + 2] == (char)(ch + k % 26) ||
            res[3][2 * i] == (char)(ch + k % 26))
          k++;
        else
          fl = 0;
      }
      res[3][2 * i + 1] = (char)(ch + k % 26);
      res[3][2 * i + 2] = (char)(ch + k % 26);
    }
  }
  for (int i = 0; i < 4; i++) cout << res[i] << endl;
  return 0;
}
