#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
using ld = long double;
const int MAXN = (int)2e6 + 239;
const int MOD = (int)998244353;
void solve() {
  int n;
  cin >> n;
  if (n == 1)
    cout << 'a';
  else if (n % 2 == 0) {
    for (int i = 0; i < (n - 1) / 2; i++) cout << 'a';
    cout << 'b';
    for (int i = 0; i < (n - 1) / 2 + 1; i++) cout << 'a';
  } else {
    for (int i = 0; i < (n - 2) / 2; i++) cout << 'a';
    cout << "bc";
    for (int i = 0; i < (n - 2) / 2 + 1; i++) cout << 'a';
  }
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}
