#include <bits/stdc++.h>
using namespace std;
string arr[52];
void solve() {
  int n;
  cin >> n;
  vector<int> path;
  int m = n;
  path.push_back(m);
  while (m > 2) {
    if (m % 2) {
      path.push_back((m - 1) / 2);
      m = (m - 1) / 2;
    } else {
      path.push_back((m - 2) / 2);
      m = (m - 2) / 2;
    }
  }
  path.pop_back();
  reverse(path.begin(), path.end());
  string u;
  string p;
  int curr = 1;
  if (m == 1) {
    u = "";
    p = "a";
  } else {
    u = "a";
    p = "a";
  }
  for (auto num : path) {
    if (num == 2 * m + 1) {
      u = u + arr[curr] + arr[curr];
      p = p + arr[curr];
      curr++;
    } else if (num == 2 * m + 2) {
      u = arr[curr] + u + arr[curr] + arr[curr];
      p = p + arr[curr];
      curr++;
    }
    m = num;
  }
  string s = p + u;
  cout << s << " " << p << "\n";
  return;
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  t = 1;
  for (int j = 0; j < 26; j++) {
    arr[j].resize(1, 'a' + j);
  }
  for (int j = 0; j < 26; j++) {
    arr[26 + j].resize(1, 'A' + j);
  }
  while (t--) {
    solve();
  }
  return 0;
}
