// Author: Shawn Das Shachin-->(shawn_das)

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define pb push_back
#define mod 1000000007
#define srt(v) sort(v.begin(),v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define OPTIMIZE_IO ios::sync_with_stdio(false); cin.tie(nullptr);

void solve() {
    ll k;
    cin >> k;

    ll block = 1;       
    ll cum_len = 2;     

    while (cum_len < k) {
        block++;
        cum_len += (block + 1);
    }

    ll prev_cum_len = cum_len - (block + 1);
    ll pos_in_block = k - prev_cum_len;

    if (pos_in_block <= block)
        cout << 'a' << endl;
    else
        cout << 'b' << endl;
}

int main() {
    OPTIMIZE_IO;

    int t;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}