#include #define MOD 1000000007LL using namespace std; typedef long long ll; typedef pair P; int n; int main(void){ scanf("%d",&n); if(n==1){ puts("a"); return 0; } deque que; int nb=-1; for(int i=30;i>=0;i--){ if(nb!=-1){ que.push_front(nb); que.push_back(nb); } if(n>>i & 1){ if(nb==-1){ nb=0; }else{ nb=(nb+1)%10; que.push_front(nb); que.push_back(nb); } } } string ans=""; while(que.size()){ int v=que.front(); que.pop_front(); ans+=(v+'a'); } cout << ans << endl; return 0; }