#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;

int N;

void  rot(int& a, int& b) {
	int na=b;
	int nb=N-a-1;

	a=na;
	b=nb;
}

int solve(vector<vector<int>>coors) {

	int ans=1e9;
	int same_num = 0;
	for (int i = 0; i<3; ++i)if (coors[0][i] == coors[1][i])same_num++;


	if (same_num == 0) {
		bool flag = true;
		for (int i = 0; i<3; ++i)if (coors[0][i] + coors[1][i] != N - 1)flag = false;

		if (flag) {
			ans = min(ans, 5);
		}
		else {

			int now_x = coors[0][0];
			int now_y = coors[0][1];
			int now_z = coors[0][2];
			for (int i = 0; i < 4; ++i) {
				for (int j = 0; j < 4; ++j) {
					for (int k = 0; k < 4; ++k) {
						int anum = 0;
						anum = (i == 3 ? 1 : i) + (j == 3 ? 1 : j) + (k == 3 ? 1 : k);
						for (int l = 0; l < 3; ++l) {
							anum += abs(coors[0][l] - coors[1][l]);
						}
						ans = min(ans, anum);

						rot(coors[0][2], coors[0][0]);
					}
					rot(coors[0][0], coors[0][1]);
				}
				rot(coors[0][1], coors[0][2]);
			}
		}
	}
	else if (same_num == 1) {
		int same_pos=-1;
		for(int i=0;i<3;++i)if(coors[0][i]==coors[1][i])same_pos=i;

		vector<int>v{ 0,1,2 };
		v.erase(find(v.begin(),v.end(),same_pos));


		for (int i = 0; i < 4; ++i) {
			int anum = 2;
			anum += (i == 3 ? 1 : i) ;
			for (int l = 0; l < 3; ++l) {
				anum += abs(coors[0][l] - coors[1][l]);
			}
			ans = min(ans, anum);
			rot(coors[0][v[0]], coors[0][v[1]]);
		}
	
	}
	else if(same_num==2){
		for (int dx = -1; dx <= 1; ++dx) {
			for (int dy = -1; dy <= 1; ++dy) {
				for (int dz = -1; dz <= 1; ++dz) {
					vector<int>ncoor(coors[0]);
					ncoor[0]+=dx;
					ncoor[1]+=dy;
					ncoor[2]+=dz;

					bool ok=true;

					int n_same_num=0;
					for (int i = 0; i < 3; ++i) {
						if(ncoor[i]<0||ncoor[i]>=N)ok=false;

						if(ncoor[i]==coors[1][i])n_same_num++;
					}
					if(n_same_num>=2)ok=false;
					if (ok) {
						int need=abs(dx)+abs(dy)+abs(dz);
						ans = min(ans, need+solve(vector<vector<int>>{ncoor, coors[1]}));
					}

				}
			}
		}
	}
	return ans;
}

int main() {
	int X;cin>>X;
	int num=X/100+3;
	cout<<"ai1";
	for(int i=0;i<num;++i)cout<<'3';
	cout<<endl;
	return 0;
}
