#include <stdio.h>
#include <stdbool.h>
bool Isprime(int num){
    if (num <= 1) return 0;
    if (num <= 3) return 1;
 
    if (num % 2 == 0 || num % 3 == 0) return 0;
 
    for (int i = 5; i * i <= num; i = i + 6) {
        if (num % i == 0 || num % (i + 2) == 0) return 0;
    }
 
    return 1;
}
int main()
{
int a[20], n, t, i, sum = 0, flag = 0;
scanf("%d", &t);
if(1<= t && t<=100){
    for(int j = 1; j<=t;j++){
    scanf("%d", &n);
if(1<= n && n<=1000000000000){
    for(i = 0;n>0; i++){
        a[i] = n%2;
        n = n/2;
    }
    for(i = i - 1; i>=0; i--){
    sum += a[i];
    }
}
    if(Isprime(sum)) printf("Binary prime\n");
    else printf("%d\n",-1);
}
}
 
  return 0;
}