#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define DIV int(1e9+7)
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
//const double PI = M_PI;  
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}

/*Coding Space*/
void dfs(int n){ // a******a or an を出力
  if(n == 0){
    cout << "an" << endl;
    return;
  }
  int tn = n;
  cout << "a";
  while(1){
    if(tn < 26){
      cout << char('a' + (tn%26));
      break;
    }else{
      cout << char('a' + (tn%26));
      tn /= 26;
    }
  }
  cout <<"a" <<  endl;
  dfs(n-1);
  return;
}
int main(){
  int n; cin >> n;
  dfs(n);
}