#include <bits/stdc++.h>
using namespace std;
const int MAXS = 201;
int N;
char letter;
char s[MAXS], p[MAXS];
void solve(int n) {
  if (n == 1) {
    s[0] = 'a';
    p[0] = 'a';
    letter = 'b';
    return;
  }
  if (n == 2) {
    s[0] = s[1] = 'a';
    p[0] = 'a';
    letter = 'b';
    return;
  }
  if (n % 2 == 0) {
    solve((n - 2) / 2);
    for (int i = strlen(s) + 1; i > (int)strlen(p) + 1; i--)
      s[i] = s[max(i - 2, 0)];
    s[strlen(p)] = letter;
    s[strlen(p) + 1] = letter;
    s[strlen(s)] = letter;
    s[strlen(s)] = letter;
    p[strlen(p)] = letter;
  } else {
    solve((n - 1) / 2);
    for (int i = strlen(s); i > (int)strlen(p); i--) s[i] = s[i - 1];
    s[strlen(p)] = letter;
    s[strlen(s)] = letter;
    s[strlen(s)] = letter;
    p[strlen(p)] = letter;
  }
  letter++;
}
int main() {
  scanf("%d", &N);
  solve(N);
  printf("%s %s\n", s, p);
}
