#include <bits/stdc++.h>
using namespace std;
int main(){
  long long M;
  cin >> M;
  if (M == 0){
    cout << "a" << endl;
  } else {
    vector<long long> A(4);
    A[0] = 1;
    A[1] = pow(M, (double) 1 / 3);
    A[2] = pow(M, (double) 2 / 3);
    A[3] = M;
    string ans;
    while (A[3] >= A[2]){
      ans += 'n';
      A[3] -= A[2];
    }
    while (A[2] >= A[1] * 2){
      ans += 'o';
      A[2] -= A[1];
    }
    while (A[3] >= A[2]){
      ans += 'n';
      A[3] -= A[2];
    }
    while (A[1] > A[0]){
      ans += 'c';
      A[1] -= A[0];
    }
    while (A[2] > A[1]){
      ans += 'o';
      A[2] -= A[1];
    }
    while (A[3] >= A[2]){
      ans += 'n';
      A[3] -= A[2];
    }
    while (A[2] >= A[1]){
      ans += 'o';
      A[2] -= A[1];
    }
    while (A[1] >= A[0]){
      ans += 'c';
      A[1] -= A[0];
    }
    reverse(ans.begin(), ans.end());
    cout << ans << endl;
    assert(ans.size() <= 60000);
  }
}