binary = {}
 
def only_one_binary(n):
    if n in binary:
        return binary[n]
    else:
        m = n
        c = 0
        while n>0:
            if n%2 != 0:
                c+=1
            n = n//2
        binary[m] = c
        return c
 
 
prime = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53]
 
for _ in range(int(input())):
    n = int(input())
    if only_one_binary(n) in prime:
        print("Binary prime")
    else:
        print(-1)