#![allow(unused_imports)]

fn main() {
    input! { t: usize }
    let lose: BTreeSet<_> =
        std::iter::successors(Some(1u64), |n| n.checked_mul(2).and_then(|n| n.checked_add(1))).collect();
    for _ in 0..t {
        input! {
            n: u64,
        }
        println!("{}", if lose.contains(&n) { "Bob" } else { "Alice" });
    }
}

// 1: x
// 2: o
// 3: x
// 4: o
// 5: o
// 6: o
// 7: x
// 8: o
// 9: o
// ...
// 14: o
// 15: x

use itertools::{Itertools as _, iproduct, izip};
use proconio::{input, marker::*};
use std::{cmp::Reverse, collections::*};

#[macro_export]
macro_rules! chmax {
    ($a:expr, $b:expr) => {{
        let tmp = $b;
        if $a < tmp {
            $a = tmp;
            true
        } else {
            false
        }
    }};
}

#[macro_export]
macro_rules! chmin {
    ($a:expr, $b:expr) => {{
        let tmp = $b;
        if $a > tmp {
            $a = tmp;
            true
        } else {
            false
        }
    }};
}

#[macro_export]
/// mvec![]
macro_rules! mvec {
    ($val:expr; ()) => {
        $val
    };
    ($val:expr; ($size:expr $(,$rest:expr)*)) => {
        vec![mvec![$val; ($($rest),*)]; $size]
    };
}