#include <bits/stdc++.h>
using namespace std;
void print(vector<vector<char>> a) {
  int n = a.size();
  for (int i = 0; i < 4; i++) {
    for (auto x : a[i]) cout << x;
    cout << '\n';
  }
  cout << '\n';
}
void solve() {
  int n;
  cin >> n;
  vector<vector<char>> a(4, vector<char>(n));
  if (n % 2 == 0) {
    if (n == 2) {
      a = {{'x', 'x'}, {'y', 'y'}, {'x', 'x'}, {'y', 'y'}};
      print(a);
      return;
    }
    int cnt = 0;
    for (int i = 0; i < 4; i += 3) {
      for (int j = 0; j < n - 1; j += 2) {
        if (cnt % 2 == 0)
          a[i][j] = 'x', a[i][j + 1] = 'x';
        else
          a[i][j] = 'y', a[i][j + 1] = 'y';
        cnt++;
      }
    }
    cnt = 0;
    a[1][0] = a[1][n - 1] = a[2][0] = a[2][n - 1] = 'b';
    for (int i = 1; i < 2; i++) {
      for (int j = 1; j < n - 2; j += 2) {
        if (cnt % 2 == 0)
          a[i][j] = 'a', a[i][j + 1] = 'a';
        else
          a[i][j] = 'c', a[i][j + 1] = 'c';
        cnt++;
      }
    }
    cnt = 0;
    for (int i = 2; i < 3; i++) {
      for (int j = 1; j < n - 2; j += 2) {
        if (cnt % 2 == 0)
          a[i][j] = 'c', a[i][j + 1] = 'c';
        else
          a[i][j] = 'a', a[i][j + 1] = 'a';
        cnt++;
      }
    }
    print(a);
  } else {
    int cnt = 0;
    for (int i = 0; i < 1; i++) {
      for (int j = 0; j < n - 2; j += 2) {
        if (cnt % 2 == 0)
          a[i][j] = 'x', a[i][j + 1] = 'x';
        else
          a[i][j] = 'y', a[i][j + 1] = 'y';
        cnt++;
      }
    }
    if (cnt % 2 == 0) {
      a[0][n - 1] = 'x';
      a[1][n - 1] = 'x';
    } else {
      a[0][n - 1] = 'y';
      a[1][n - 1] = 'y';
    }
    cnt = 0;
    for (int i = 1; i < 2; i++) {
      for (int j = n - 2; j >= 1; j -= 2) {
        if (cnt % 2 == 0)
          a[i][j] = 'a', a[i][j - 1] = 'a';
        else
          a[i][j] = 'b', a[i][j - 1] = 'b';
        cnt++;
      }
    }
    if (cnt % 2 == 0) {
      a[2][0] = 'a';
      a[3][0] = 'a';
    } else {
      a[2][0] = 'b';
      a[3][0] = 'b';
    }
    cnt = 0;
    for (int i = 2; i < 3; i++) {
      for (int j = 1; j < n; j += 2) {
        if (cnt % 2 == 0)
          a[i][j] = 'p', a[i][j + 1] = 'p';
        else
          a[i][j] = 'q', a[i][j + 1] = 'q';
        cnt++;
      }
    }
    cnt = 0;
    for (int i = 3; i < 4; i++) {
      for (int j = n - 1; j >= 1; j -= 2) {
        if (cnt % 2 == 0)
          a[i][j] = 'x', a[i][j - 1] = 'x';
        else
          a[i][j] = 'y', a[i][j - 1] = 'y';
        cnt++;
      }
    }
    print(a);
  }
}
int main() {
  int t;
  t = 1;
  while (t--) {
    solve();
  }
}
