#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <deque>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
using ld = long double;

int main(){
    ll m; cin >> m;
    auto f = [](ll x){
        return x*(x+1)/2*(x+2)/3;
    };
    auto g = [](ll x){
        return x*(x+1)/2;
    };
    ll x1 = 1, wa = 20000;
    while(wa-x1 > 1){
        ll wj = (x1+wa)/2;
        if(f(wj) <= m) x1 = wj;
        else wa = wj;
    }
    ll m1 = m-f(x1);
    
    auto h = [&](ll m1, ll x){
        vector<ll> res;
        for(; x > 0; x--){
            res.emplace_back(m1/g(x));
            m1 %= g(x);
        }
        return res;
    };
    
    auto v = h(m1, x1);
    reverse(v.begin(), v.end());
    string ans = "";
    for(int i = 0; i < x1; i++){
        ans += "con";
        for(int j = 0; j < v[i]; j++) ans += "n";
    }
    cout << ans << endl;
    return 0;
}