#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;

int n;
void pri(int t){
	string s = "iwi";
	rep(i, t - 1){
		s += "wi";
	}
	cout << s << endl;
	return;
}

void pri2(int t, int nokori){
	string s = "iwi";
	rep(i, t - 1){
		s += "wi";
	}
	rep(i, nokori){
		if(i % 3 == 1) s += 'a';
		else if(i % 3 == 2) s += 'b';
		else s += 'c';
	}
	cout << s << endl;
}

int main(void){
	cin >> n;
	if(n == 1){
		cout << "a" << endl;
	}else if(n == 2){
		cout << "ab" << endl;
	}else if(n == 3){
		cout << "abc" << endl;
	}else{
		int len = 3;
		for (int i = 1; i <= 1000000; ++i){
			if(i * i + len == n){
				pri(i);
				break;
			}else if(i * i + len > n){
				// printf("i %d len %d\n", i, len);
				// printf("%d\n", ((i - 1) * (i - 1) + len - 2));
				// printf("%d\n", n - ((i - 1) * (i - 1) + len - 2));
				pri2(i - 1, n - ((i - 1) * (i - 1) + len - 2));
				break;
			}
			len += 2;
		}
	}
	return 0;
}