/*in the name of almighty ALLAH*/

#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 int long long
#define endl '\n'
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define MOD 1000000007
#define MOD2 987654319
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define sz(x) (int)x.size()

template <typename T> using pbds = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename T> using multi_pbds = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

//***********************************START*******************************************//

void solve()
{
    int n; cin >> n;
    int lo = 2, hi = 5e8;
    char ch = 'a';

    while(lo <= hi){
        int mid = (lo + hi)/2;
        int sum = (mid*(mid+1) - 2 ) /2;
        if(sum == n){
            ch = 'b';
            break;
        }
        else if(sum < n) lo = mid+1;
        else hi = mid-1;
    }

    cout << ch << endl;
}

//***********************************END*********************************************//
int32_t main(){ fast

    int32_t t = 1, i;
      cin >> t;
    for(i = 1; i <= t; i++)
    {
       // cout << "Case " << i << ": ";
        solve();
    }
}