``python
def count_set_bits(n):
    count = 
    while n > :
        if n & 1 == 1:
            count += 1
        n >>= 1
    return count
 
def is_prime(num):
    if num <= 1:
        return False
    for i in range(2, int(num**.5) + 1):
        if num % i == :
            return False
    return True
 
t = int(input())
 
for _ in range(t):
    n = int(input())
 
    binary_representation = bin(n)[2:]
 
    set_bits_sum = count_set_bits(n)
 
    if is_prime(set_bits_sum):
        print("Binary prime")
    else:
        print("-1")
```