#include<bits/stdc++.h>
#include<math.h>
 
#define    str     string
#define    sz      size()
#define    bgn      begin()
#define    ll      long long int
#define    li      long int
#define    con     continue
#define    rt      return 0
#define    fr      first
#define    sec     second
#define    pf      push_front
#define    pb      push_back
#define    vb      vct.begin()
#define    ve      vct.end()
#define    vs      vct.size()
#define    db      dq.begin()
#define    de      dq.end()
#define    ds      dq.size()
#define    ib      it.begin()
#define    ie      it.end()
#define    itf     it->first
#define    its     it->second
#define    lb      lst.begin()
#define    le      lst.end()
#define    mb      mp.begin()
#define    me      mp.end()
#define    stb     st.begin()
#define    ste     st.end()
#define    sb      s.begin()
#define    se      s.end()
#define    NL      printf("\n")
#define   yes       printf("YES\n")
#define   no        printf("NO\n")
#define   forone    for(i=1;i<=n;i++)
#define   forzero   for(i=0;i<n;i++)
#define   sortone   sort(ara+1,ara+n+1)
#define   sortzero  sort(ara,ara+n)
#define   get(ara)  forone cin>>ara[i]
#define tc int tc;scanf("%d",&tc);while(tc--)
#define mxn 200111
using namespace std;
bool ara[200];
void prime_numbers()
{
    ara[0]=ara[1]=true;
    for(ll i=2;i<=200;i++)
    {
        if(ara[i]==false)
        {
            for(ll j=i+i;j<=200;j+=i) ara[j]=true;
        }
    }
}
 
int main( )
{
 
prime_numbers();
tc
  {
        ll n,i,x,j,ans=0,cnt=0;
        string s;
        cin>>n;
        while(n)
        {
            ans+=(n%2);
            n/=2;
        }
        if(ara[ans]) cout<<-1;
        else cout<<"Binary prime";
        NL;
 
  }
 
    return 0;
}