#include <bits/stdc++.h>
using namespace std;
const int SIZE = 3e5 + 5;
const long long INF = 1e14 + 5;
const long long MOD = 1e9 + 7;
struct abc {
  int num;
  int pos;
};
bool operator<(abc a, abc b) {
  if (a.pos != b.pos) {
    return a.pos > b.pos;
  }
  return a.num > b.num;
}
int gcd(int a, int b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
bool inRange(int n, int m, int n0, int m0) {
  return n0 > -1 && m0 > -1 && m0 < m && n0 < n;
}
bool cmp1(pair<int, int> a, pair<int, int> b) { return a.first < b.first; }
bool cmp2(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int len, total;
string ms, mb;
void rec(int start, int pos) {
  if (pos == mb.length()) {
    ++total;
    return;
  }
  for (int i = start; i < len; ++i) {
    if (ms[i] != mb[pos]) continue;
    rec(i + 1, pos + 1);
  }
}
int count(string s, string b) {
  len = s.length();
  total = 0;
  ms = s;
  mb = b;
  rec(0, 0);
  return total;
}
string check(int n) {
  for (int i = 0; i < 201; ++i)
    for (int j = i; i + j < 201; ++j)
      for (int k = i; i + j + k < 201; ++k) {
        int t1 = i * j * k;
        int t2 = i * j * k + i * j + i + 1;
        int k1 = (n - t1) / t2;
        int k2 = n / t2;
        int l1 = i + j + k + k1 + 4;
        int l2 = i + j + k + k2 + 3;
        if (l2 < 201 && k2 * t2 == n) {
          string ans = "";
          for (int z = 0; z < i; ++z) {
            ans += 'a';
          }
          for (int z = 0; z < j; ++z) {
            ans += 'b';
          }
          for (int z = 0; z < k; ++z) {
            ans += 'c';
          }
          ans += "abc";
          for (int z = 0; z < k2; ++z) {
            ans += 'd';
          }
          return ans;
        }
        if (l1 < 201 && t1 + k1 * t2 == n) {
          string ans = "";
          for (int z = 0; z < i; ++z) {
            ans += 'a';
          }
          for (int z = 0; z < j; ++z) {
            ans += 'b';
          }
          for (int z = 0; z < k; ++z) {
            ans += 'c';
          }
          ans += "dabc";
          for (int z = 0; z < k1; ++z) {
            ans += 'd';
          }
          return ans;
        }
      }
  return "";
}
int main() {
  int n;
  scanf("%d", &n);
  string s1 = check(n);
  string s2 = "abcd";
  printf("%s %s", s1.c_str(), s2.c_str());
  return 0;
}
