package main

import (
	"fmt"
	"sort"
)

const maxn = 100000

var primes = []int{2, 3}

func isPrime(n int) bool {
	for _, x := range primes {
		if x*x > n {
			break
		}

		if n%x == 0 {
			return false
		}
	}
	return true
}

func init() {
	for i := 5; i <= maxn; i += 2 {
		if isPrime(i) {
			primes = append(primes, i)
		}
	}
}

func main() {
	var g int
	fmt.Scan(&g)

	for i := 0; i < g; i++ {
		var n int
		fmt.Scan(&n)

		if n == 1 {
			fmt.Println("Bob")
			continue
		}

		var ub = sort.Search(len(primes), func(i int) bool {
			return primes[i] > n
		})

		if ub&1 == 1 {
			fmt.Println("Alice")
		} else {
			fmt.Println("Bob")
		}
	}
}