#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream& operator<<(ostream& o, const pair<T, U>& p) {
  o << "(" << p.first << "," << p.second << ")";
  return o;
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& v) {
  o << "[";
  for (T t : v) {
    o << t << ",";
  }
  o << "]";
  return o;
}
long long comb[205][205];
int n;
int num[10];
int z;
bool sol(int pattern, int pre, int prea, int d) {
  if (d == 0) {
    if (pattern == n) {
      int i = 0;
      vector<int> res;
      while (num[i] >= 0) res.push_back((num[i++]));
      reverse((res).begin(), (res).end());
      for (auto k : res) {
        for (int j = (int)(0); j < (int)(k); j++) printf("a");
        printf("b");
      }
      printf(" ");
      for (int j = (int)(0); j < (int)(z); j++) printf("a");
      printf("b\n");
      return true;
    } else {
      return false;
    }
  }
  d--;
  for (int i = 0; i <= 200 - pre - d; i++) {
    num[d] = i;
    int npattern = pattern + comb[prea + i][z];
    if (npattern > n) continue;
    if (sol(npattern, pre + i + 1, prea + i, d)) return true;
  }
  return false;
}
int main() {
  fill(comb[0], comb[201], 0);
  comb[0][0] = 1;
  for (int i = (int)(1); i < (int)(201); i++) {
    comb[i][0] = 1;
    for (int j = (int)(1); j < (int)(201); j++)
      comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
  }
  cin >> n;
  int initj = 3;
  if (n < 10) initj = 2;
  for (int i = (int)(1); i < (int)(9); i++) {
    for (int j = (int)(initj); j < (int)(50); j++) {
      z = j;
      fill(num, num + 10, -1);
      if (sol(0, 0, 0, i)) return 0;
    }
  }
  assert(false);
  return 0;
}
