#include<bits/stdc++.h>
using std::cin, std::cout;
const int mod = 1e9 + 7;
const int N = 500005;
const int inv2 = (mod + 1) / 2;
using u64 = unsigned long long;
using ll = long long;
int n;
int pop[10000];
int popc(u64 x) {
	return
	pop[x % 10000] + 
	pop[x / 10000 % 10000] + 
	pop[x / 100000000 % 10000] + 
	pop[x / 1000000000000 % 10000] + 
	pop[x / 10000000000000000];
}
const int V = 200;
ll jump[V][20][V];

ll naive(int sum, ll low, ll base) {
	ll x = low;
	for(;++low < base;) {
		ll tmp = low - popc(low) - sum;
		if(tmp > x) return low;
	}
	return -1;
}
ll naive(ll low) {
	ll x = low;
	for(;;) {
		++ low;
		ll tmp = low - popc(low);
		if(tmp > x) return low;
	}
	return -1;
}
int main() {
#ifdef zqj
	freopen("$.in", "r", stdin);
#endif
	for(int i = 0;i < 1e4;++i) {
		pop[i] = pop[i / 10] + i % 10;
	}
	std::ios::sync_with_stdio(false), cin.tie(0);
	ll prod = 1;
	for(int j = 1;j <= 18;++j) {
		prod *= 10;
		ll base = prod / 10;
		for(int i = 0;i < (20 - j) * 9;++i) {
			for(int k = 0;k < V && k < prod;++k) {
				ll & res = jump[i][j][k];
				ll z = k;
				if(j == 4) {
					//puts("233");
				}
				for(;;) {
					z += jump[i + z / base][j - 1][z % base];
					if(z % base >= V) {
					//	puts("233");
					}
					ll res = naive(i, z, prod);
					if(res == -1) {
						break;
					}
					assert(res / base != z / base);
					z = res;
					assert(z % base < V);
					// std::cerr << j << ' ' << i << ' ' << k << ' ' << z << '\n';
				}
				res = z - k;
			}
		}
	}
	int t; cin >> t;
	for(int i = 0;i < t;++i) {
		ll n;// cin >> n;
		//n = (ll)1e18 - i;
		cin >> n;
		ll now = 0;
		for(ll base = 1e18, i = 18;i >= 1;--i) {
			for(;now / base < n / base;) {
				now += jump[popc(now / base)][i][now % base];
				now = naive(now);
			}
			base /= 10;
		}
		if(now == n) {
//			cout << now << ' ' << now - popc(now) << ' ';
		}
		cout << (now != n ? "Algosia" : "Bajtek") << '\n';
	}
}