#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	vector<int> nums;
	{	int sum1 = 0, sum2 = 0;
		for(int i = 1; ; i += 2) {
			sum1 += i;
			if(sum1 > (int)1e9) break;
			nums.push_back(sum1);
			sum2 += i+1;
			nums.push_back(sum2);
		}
//		each(i, nums) cerr << *i << endl;
	}
	//abab
	int N;
	while(cin >> N) {
		string S;
		int p = 0;
		while(N > 0) {
			int k = upper_bound(all(nums), N) - 1 - nums.begin();
			rep(i, k+1)
				S += char('a' + p + i % 2);
			p += 2;
			N -= nums[k];
		}
		cout << S << endl;
	}
	return 0;
}