#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
const int mx = 1e7 +1;
bool prime[mx];
ll MX = 1e9;
int mp[mx][30];
 
using namespace std;
void Prime_()
{
    prime[0]=1;
    prime[1]=0;
    for(ll i=4; i<=mx; i+=2)
    {
        prime[i]=1;
    }
    for(ll i=3; i<=sqrt(mx); i+=2)
    {
        if(prime[i]==0)
        {
            for(ll j=i*i; j<mx; j+= i*2)
            {
                prime[j]=1;
            }
        }
        //prime[i]=1;
    }
}
 
int main(){
    Prime_();
 
 
    ll t;cin >>t;
    while(t--){
        ll n;cin >> n;
        ll cnt=0;/*
        10 = 10% 2 = 0
             5 %2 = 1
             2 %2 = 0;
             1 % 2  = 1
             */
        for(int i=0;n>0;i++){
            cnt += n%2;
            n = n/2;
        }
        //cout << cnt << endl;
        if(prime[cnt]==0){
            cout << "Binary prime" << endl;
        }
        else cout << -1 << endl;
    }
}