#include <stdio.h>
#include <stdbool.h>
 
// Function to check if a number is prime
bool isPrime(int n) {
    if (n <= 1)
        return false;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0)
            return false;
    }
    return true;
}
 
// Function to count set bits in a number
int countSetBits(unsigned long long n) {
    int count = 0;
    while (n) {
        n &= (n - 1);
        count++;
    }
    return count;
}
 
int main() {
    int T;
    scanf("%d", &T);
 
    while (T--) {
        unsigned long long N;
        scanf("%llu", &N);
 
        int setBits = countSetBits(N);
 
        if (isPrime(setBits))
            printf("Binary prime\n");
        else
            printf("-1\n");
    }
 
    return 0;
}