#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int i_inf = 1e9;
const long long mod = 1000000007;
const long double eps = 1e-13;
const long double pi = 3.14159265359;
mt19937 _rand(time(NULL));
clock_t timer = clock();
const int mxn = 2e5 + 5;
long long modpow(long long x, long long n) {
  if (n == 0) return 1 % mod;
  long long u = modpow(x, n / 2);
  u = (u * u) % mod;
  if (n % 2) u = (u * x) % mod;
  return u;
}
void solve() {
  int n;
  cin >> n;
  if (n == 1) {
    cout << 'a' << endl;
    return;
  }
  if (n == 2) {
    cout << "ab" << endl;
    return;
  }
  if (n == 3) {
    cout << "abc" << endl;
    return;
  }
  if (n == 4) {
    cout << "abcd" << endl;
    return;
  }
  if (n % 2 == 0) {
    for (int i = (0); i < (n / 2); i++) cout << 'a';
    cout << "c";
    for (int i = (0); i < (n / 2 - 1); i++) cout << 'a';
    cout << endl;
  } else {
    for (int i = (0); i < (n / 2); i++) cout << 'a';
    cout << "cd";
    for (int i = (0); i < (n / 2 - 1); i++) cout << 'a';
    cout << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int T = 1;
  cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}
