#include <bits/stdc++.h>
using namespace std;
char field[4][110];
int main() {
  for (int n; cin >> n;) {
    if (n & 1) {
      for (int i = 0; i < 2; i++) {
        for (int j = 0, k; j < n - 1; j += 2) {
          for (k = 0; k < 26; k++) {
            if (i > 0 &&
                (field[i - 1][j] == 'a' + k || field[i - 1][j + 1] == 'a' + k))
              continue;
            if (j > 0 && field[i][j - 1] == 'a' + k) continue;
            break;
          }
          assert(k < 26);
          field[i][j] = field[i][j + 1] = 'a' + k;
        }
      }
      int j = n - 1, k;
      for (k = 0; k < 26; k++) {
        if (j > 0 && field[0][j - 1] == 'a' + k) continue;
        if (j > 0 && field[1][j - 1] == 'a' + k) continue;
        break;
      }
      assert(k < 26);
      field[0][n - 1] = field[1][n - 1] = 'a' + k;
      j = 0;
      for (k = 0; k < 26; k++) {
        if (field[1][0] == 'a' + k) continue;
        break;
      }
      assert(k < 26);
      field[2][0] = field[3][0] = 'a' + k;
      for (int i = 2; i < 4; i++) {
        for (int j = 1, k; j < n; j += 2) {
          for (k = 0; k < 26; k++) {
            if (i > 0 &&
                (field[i - 1][j] == 'a' + k || field[i - 1][j + 1] == 'a' + k))
              continue;
            if (j > 0 && field[i][j - 1] == 'a' + k) continue;
            break;
          }
          assert(k < 26);
          field[i][j] = field[i][j + 1] = 'a' + k;
        }
      }
      for (int i = 0; i < 4; i++) {
        for (int j = 0; j < n; j++) putchar(field[i][j]);
        puts("");
      }
    } else {
      for (int i = 0; i < 4; i++) {
        int j, k, r;
        if (i == 1 || i == 2) {
          if (i == 1) {
            for (k = 0; k < 26; k++) {
              if (field[i - 1][0] == 'a' + k) continue;
              break;
            }
            assert(k < 26);
            field[i][0] = 'a' + k;
            field[i + 1][0] = 'a' + k;
          }
          j = 1;
          r = n - 1;
        } else
          j = 0, r = n;
        for (; j < r; j += 2) {
          for (k = 0; k < 26; k++) {
            if (i > 0 && field[i - 1][j] == 'a' + k) continue;
            if (i > 0 && field[i - 1][j + 1] == 'a' + k) continue;
            if (j > 0 && field[i][j - 1] == 'a' + k) continue;
            break;
          }
          assert(k < 26);
          field[i][j] = field[i][j + 1] = 'a' + k;
        }
        if (i == 2) {
          for (k = 0; k < 26; k++) {
            if (field[i - 2][n - 1] == 'a' + k) continue;
            if (field[i - 1][n - 2] == 'a' + k) continue;
            if (field[i][n - 2] == 'a' + k) continue;
            break;
          }
          assert(k < 26);
          field[i - 1][n - 1] = 'a' + k;
          field[i][n - 1] = 'a' + k;
        }
      }
      for (int i = 0; i < 4; i++) {
        for (int j = 0; j < n; j++) putchar(field[i][j]);
        puts("");
      }
    }
  }
  return 0;
}
