#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

ll n, f[22][180][180], a[22];

ll dfs(int pos, int sum, int lst) {
	if (!pos) {
		return lst <= sum ? lst + 1 : 1;
	}
	if (f[pos][sum][lst] != -1) {
		return f[pos][sum][lst];
	}
	int k = lst;
	for (int i = 0; i <= 9; ++i) {
		lst = dfs(pos - 1, sum + i, lst);
	}
	return f[pos][sum][k] = lst;
}

void solve() {
	scanf("%lld", &n);
	int m = -1, lst = 0;
	while (n) {
		a[++m] = n % 10;
		n /= 10;
	}
	int s = 0;
	for (int i = m; ~i; --i) {
		for (int j = 0; j <= a[i]; ++j) {
			lst = dfs(i, s, lst);
			++s;
		}
	}
	puts(lst > 1 ? "Algosia" : "Bajtek");
}

int main() {
	mems(f, -1);
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}