#include <bits/stdc++.h>
using namespace std;
typedef priority_queue<pair<int, int>, vector<pair<int, int> >,
                       greater<pair<int, int> > >
    pq;
long long mod = 1000 * 1000 * 1000 + 7;
int main() {
  int n;
  cin >> n;
  for (int i = (0); i < ((n - (n % 2)) / 2); i++) {
    if (i % 2 == 0)
      cout << "aa";
    else
      cout << "bb";
  }
  if (n % 2 > 0) {
    if ((n / 2) % 2 > 0)
      cout << "b";
    else
      cout << "a";
  }
  return 0;
}
