#include <bits/stdc++.h>
using namespace std;
     
const long long mod = 10000007;
const long long INF = LLONG_MAX;
const int N = 1001000;

void solve () {
    long long n, k;
    cin >> k;

    long long l = -1, r = k;

    k = 2LL * (k + 1);

    for (int i = 0; i < 100; i++) {
        long long m = l + (r - l) / 2;

        long long x = (m * m) + m;

        if (k <= x) {
            r = m;
            if (k == x) {
                break;
            }
        } else {
            l = m;
        }
    }
    if ((r * r) + r == k) {
        cout << "b";
    } else {
        cout << "a";
    }
} 
int main () {
    ios::sync_with_stdio(false);
    cin.tie(nullptr); 

    long long t;
    cin >> t;

    while (t--) {
        solve();
        cout << "\n";
    }
    return 0;
}