#include <bits/stdc++.h>
using namespace std;
const double EPS = 0.00000001;
const int INF = 1000000000;
template <class T>
void pp(T t, int n) {
  for (int i = 0; i < (int)n; i++) {
    cout << t[i] << ' ';
  }
  cout << endl;
}
const int N = 100;
int main() {
  char t[N][N];
  int n;
  cin >> n;
  char c = 'a';
  if (n % 2 == 1) {
    bool up = true;
    for (int w = 0; w < (int)n; w++) {
      if (up) {
        if (w == 0) {
          t[2][w] = t[3][w] = c;
          if (c == 'z')
            c = 'a';
          else
            c++;
        }
        if (w == n - 1) {
          t[0][w] = t[1][w] = c;
          break;
        }
        t[0][w] = t[0][w + 1] = c;
        if (c == 'z')
          c = 'a';
        else
          c++;
        t[1][w] = t[1][w + 1] = c;
        if (c == 'z')
          c = 'a';
        else
          c++;
      } else {
        if (w == n - 1) {
          t[2][w] = t[3][w] = c;
          break;
        }
        t[2][w] = t[2][w + 1] = c;
        if (c == 'z')
          c = 'a';
        else
          c++;
        t[3][w] = t[3][w + 1] = c;
        if (c == 'z')
          c = 'a';
        else
          c++;
      }
      up = !up;
    }
    for (int i = 0; i < (int)4; i++) {
      for (int j = 0; j < (int)n; j++) {
        cout << t[i][j];
      }
      cout << endl;
    }
    return 0;
  }
  for (int w = 0; w < (int)n; w++) {
    if (w == 0 || w == n - 1) {
      t[1][w] = t[2][w] = c;
      if (c == 'z')
        c = 'a';
      else
        c++;
    }
    if (w % 2 == 0) {
      t[0][w] = t[0][w + 1] = c;
      if (c == 'z')
        c = 'a';
      else
        c++;
      t[3][w] = t[3][w + 1] = c;
      if (c == 'z')
        c = 'a';
      else
        c++;
      continue;
    }
    if (!(w == 0 || w == n - 1)) {
      t[1][w] = t[1][w + 1] = c;
      if (c == 'z')
        c = 'a';
      else
        c++;
      t[2][w] = t[2][w + 1] = c;
      if (c == 'z')
        c = 'a';
      else
        c++;
    }
  }
  for (int i = 0; i < (int)4; i++) {
    for (int j = 0; j < (int)n; j++) {
      cout << t[i][j];
    }
    cout << endl;
  }
  return 0;
}
