// 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);


ll bs(ll k) {
    ll left = 1, right = 2e8;
    ll block = -1;

    while (left <= right) {
        ll mid = left + (right - left) / 2;
        ll cum_len = mid * (mid + 3) / 2;

        if (cum_len >= k) {
            block = mid;
            right = mid - 1;
        } else {
            left = mid + 1;
        }
    }

    return block;
}

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

    ll block = bs(k);
    ll i=block-1 ;
    ll prev_cum_len = (i* (i+ 3)) / 2;
    ll pos_in_block = k - prev_cum_len;

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

int main() {
    OPTIMIZE_IO;

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

    return 0;
}