为什么这会T

// Problem: D. Deleting Divisors
// Contest: Codeforces - Codeforces Round 726 (Div. 2)
// URL: https://codeforces.com/problemset/problem/1537/D
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// Author: Zhong Jiaxuan
// Luogu: 637788
// Email: zhongjiaxuankimi@qq.com
// Tips:
//   - INT_MAX = 2147483647
//   - INT_MIN = -2147483648
// Tag:
//
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define int long long
#define db double
using namespace std;
map<int, bool> a;
signed main() {
  ios::sync_with_stdio(false);
  for (int i = 1; (1 << i) <= 10000000000; i += 2)
    a[1 << i] = 1;
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    if (n % 2)
      puts("Bob");
    else if (a[n])
      puts("Bob");
    else
      puts("Alice");
  }
}