/**
 * All Praise to Allah
 * ---------------------
 * Author     : Al Kayes Rifat
 * Portfolio  : alkayesrifat.netlify.app
 * Date       : 06/01/2026 (Tuesday)
 * Time       : 20:57 
 * ---------------------
 */

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>// - Use 'less<T>' for set, 'less_equal<T>' for multiset
#define ll long long int
#define ull unsigned long long
#define endl "\n"

int main(){

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    map<ll,char>mp;

   

    int alkayesrifat ;
    cin >>  alkayesrifat ;
    while(alkayesrifat--)
    {
        ll a ;
        cin >> a;
        
        a++;

        ll sum = a;

        ll our = (-1 + sqrt( ( ((long long)sum*8) + 1)))/2;

        our = (our * (our+1)) / 2;
        // cout << a << " " << our << ' ';

        if(our == a){
            cout << 'b'<<endl;
        }
        else{
            cout <<'a'<<endl;
        }

       






    }

    return 0;
}