#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

const int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
const int dy[8] = { 0,1,1,1,0,-1,-1,-1 };


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)///


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	vi isprime(100000, 1);
	isprime[0] = 0;
	isprime[1] = 0;
	for (int i = 0; i < 100000; ++i) {
		if (isprime[i]) {
			for (int j = 2; j*i < 100000; ++j) {
				isprime[i*j] = false;
			}
		}
	}
	string ans, ans2;
	int cnt = 0;
	while (n > 1) {
		int val = n, t = 0;
		while (val % 2 == 0) {
			val /= 2;
			t++;
		}


		REP(i, t + 1) {
			ans += 'a' + cnt;
			ans2 += 'a' + cnt;
		}

		if (n == pow(2, t))ans2.pop_back();
		n = ((n - (int)pow(2, t)) / (int)pow(2, t));
		cnt++;
		cnt %= 26;
	}
	reverse(ALL(ans2));
	if (n == 1)ans += 'a' + cnt;
	cout << ans + ans2 << endl;
	return 0;
}