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