#include <bits/stdc++.h>
using namespace std;
char ans[10][1010];
void place(int x1, int y1, int x2, int y2) {
  set<char> s;
  for (int i(min(x1, x2) - 1); i <= max(x1, x2) + 1; i++)
    for (int j(min(y1, y2) - 1); j <= max(y1, y2) + 1; j++) s.insert(ans[i][j]);
  for (char i('a');; i++) {
    if (s.find(i) == s.end()) {
      ans[x1][y1] = ans[x2][y2] = i;
      return;
    }
  }
}
int main() {
  int n;
  cin >> n;
  if (n & 1) {
    for (int i(1); i < n; i += 2) {
      place(1, i, 1, i + 1);
      place(2, i, 2, i + 1);
    }
    place(1, n, 2, n);
    place(3, 1, 4, 1);
    for (int i(2); i < n; i += 2) {
      place(3, i, 3, i + 1);
      place(4, i, 4, i + 1);
    }
  } else {
    place(1, 1, 2, 1);
    place(1, n, 2, n);
    for (int i(2); i < n; i += 2) {
      place(1, i, 1, i + 1);
      place(2, i, 2, i + 1);
    }
    for (int i(1); i < n; i += 2) {
      place(3, i, 3, i + 1);
      place(4, i, 4, i + 1);
    }
  }
  for (int i(1); i <= 4; i++) {
    for (int j(1); j <= n; j++) cout << ans[i][j];
    cout << '\n';
  }
  return 0;
}
