import java.util.Scanner;
 
public class Main {
 
    // Function to count the number of set bits in a binary representation
    static int countSetBits(int n) {
        int count = 0;
        while (n > 0) {
            count += n & 1;
            n >>= 1;
        }
        return count;
    }
 
    // Function to check if a number is prime
    static boolean isPrime(int n) {
        if (n <= 1) return false;
        for (int i = 2; i * i <= n; i++) {
            if (n % i == 0) return false;
        }
        return true;
    }
 
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
 
        // Read the number of queries
        int T = sc.nextInt();
 
        for (int t = 0; t < T; t++) {
            // Read the decimal number
            int N = sc.nextInt();
 
            // Convert decimal number to binary and count set bits
            int setBits = countSetBits(N);
 
            // Check if the sum of set bits is prime
            if (isPrime(setBits)) {
                System.out.println("Binary prime");
            } else {
                System.out.println("-1");
            }
        }
    }
}