#ifdef MY_LOCAL #include "D://competitive_programming/debug/debug.h" #define debug(x) cerr << "[" << #x<< "]:"<<x<<"\n" #else #define debug(x) #endif #define REP(i, n) for(int i = 0; i < n; i ++) #define REPL(i,m, n) for(int i = m; i < n; i ++) #define SORT(arr) sort(arr.begin(), arr.end()) #define LSOne(S) ((S)&-(S)) #define M_PI 3.1415926535897932384 #define INF 1e18 #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; using namespace std; typedef long long ll; #define int ll typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int, int> ii; typedef vector<ii> vii; typedef vector<vii> vvii; typedef double ld; typedef tree<int,null_type,less<int>, rb_tree_tag, tree_order_statistics_node_update> ost; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int x;cin>>x; if (x == 0) { cout<<"a\n";return 0; } vi prefixes = {1}; const int M1 = 20000; REP(i, 15) { prefixes.push_back((1LL<<i)); } REP(i, M1) { prefixes.push_back(prefixes.back()); } vi subpre = {prefixes[0]}; REPL(i, 1, (int)prefixes.size()) { subpre.push_back(subpre.back() + prefixes[i]); } //debug(prefixes); debug(subpre.back()); reverse(subpre.begin(), subpre.end()); reverse(prefixes.begin(), prefixes.end()); prefixes.push_back(0); int m = x; string str; REP(i, (int)subpre.size()) { int val = subpre[i]; int cc = m/val; REP(jj, cc) { str.push_back('c'); } m -= cc*val; str.push_back('o'); int del = prefixes[i] - prefixes[i+1]; REP(jj, del) { str.push_back('n'); } } //debug(str.size()); cout<<str<<"\n"; }