///Jillur Rahman Riyad
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define optimize()  ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pi 3.14159265358979323846264338327950288419716939937510
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<string> vs;
#define all(v) ((v).begin()), ((v).end())
#define rall(v) ((v).rbegin()), ((v).rend())
#define sz(v) ((int)((v).size()))
#define forcin(n) for(auto &x : n) cin>>x;
#define FOR(x,n) for(i=x;i<n;i++)
#define FORE(x,n) for(i=x;i<=n;i++)
#define forcout(n) for(auto x : n) cout << x << " ";
#define it vector<int>::iterator
#define pb push_back
#define pp pop_back
#define _ " "
#define endo '\n'
#define ff first
#define ss second
#define INF 1000000007
ll power(ll b,ll p){
    ll ans=1;
    while(p){
        if(p&1)ans=(ans*b)%INF;
        b=(b*b)%INF;
        p>>=1;
    }
    return ans%INF;
}
void SieveOfEratosthenes(int n){
    bool prime[n + 1];
    memset(prime, true, sizeof(prime));
    for (int p = 2; p * p <= n; p++){
        if (prime[p] == true){
            for (int i = p * p; i <= n; i += p)
                prime[i] = false;
        }
    }
}

void solve(){
    ll i,n;cin>>n;
    ll x=8*(n+1);
    x++;
    ll sq=sqrt(x);
    if(sq*sq==x)
    {
        sq--;
        if(sq%2==0)cout<<'b'<<endo;
        else cout<<'a'<<endo;
    }
     else cout<<'a'<<endo;
}

int main(){
    optimize()
    int t;
    cin >> t;
    //t=1;
    while(t--){
        solve();
    }
}