#include <bits/stdc++.h>

using namespace std;

const int M = 60010;

long long m;
int n;

struct Node {
  char c;
  int pre, nxt;
} a[M];

int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> m, n = 40000;
  for (int i = 1; i <= n; i++) {
    a[i].c = i % 2 ? 'c' : 'o';
    a[i].pre = i - 1, a[i].nxt = i + 1;
  }
  a[0].nxt = 1, a[n].nxt = M;
  for (int i = 20000; i >= 1; i--) {
    long long p = i * (i + 1) / 2;
    int last = 2 * i;
    while (m - p >= 0) {
      n++;
      a[a[last].nxt].pre = n;
      a[n] = {'n', last, a[last].nxt};
      a[last].nxt = n;
      m -= p, last = n;
    }
  }
  for (int i = a[0].nxt; i != M; i = a[i].nxt) {
    cout << a[i].c;
  }
  return 0;
}