#include <bits/stdc++.h>
using namespace std;
string p, s;
int n;
void dfs(int n, char c) {
  if (n == 1) {
    s += c, p += c;
    return;
  } else if (n == 2) {
    s += c, s += c, p += c;
    return;
  }
  if (n & 1) {
    dfs(n / 2, c + 1);
    s = p + c + s.substr(p.size(), s.size() - p.size() + 1) + c + c, p += c;
  } else {
    dfs(n / 2 - 1, c + 1);
    s = p + c + c + s.substr(p.size(), s.size() - p.size() + 1) + c + c, p += c;
  }
}
int main() {
  scanf("%d", &n);
  dfs(n, 'a');
  cout << s << ' ' << p;
}
