e.

#include<stdio.h>
#include<math.h>

int isprime(int n){

    for(int i=2;i<=sqrt(n);i++){
        if(n%i==0){
            return 0;
        }
    }
    return 1;

}
int main(){
    int n;
    scanf("%d",&n);
    int ar[n+5];
    int mark[n+5];
     for(int i=0;i<n+5;i++){
        mark[i]=0;
     }
    int cntzero =0,indx=0;
    int cnt=0;
    int cnt2=0;
    for(int i=0;i<n;i++){
        scanf("%d",&ar[i]);
        if(ar[i]==0){
            cntzero++;
            cnt++;
            continue;
        }
        else if(ar[i]==2){
            cnt++;
            mark[i]=1;
            continue;
        }
        else if(isprime(ar[i])){
            cnt++;
            mark[i]=1;
        }
        else if(ar[i]%2==0){
            cnt++;
            mark[i]=1;
        }

    }
    if(cntzero==0){
        printf("Beriye jao, beyadob kothakar!\n");
    }
    else{
        if(cnt==n){
            printf("Solution Achhe Habibi!\n");
        }
        else{
             for(int i=0;i<n;i++){
                if(mark[i]==0){
                    if((ar[i]==0 && mark[i-1]==0 && i>0) || (ar[i]==0 && mark[i+1]==0) && i<n-1){
                        printf("Solution Achhe Habibi!\n");
                        return 0;
                    }
                }
             }
              printf("Beriye jao, beyadob kothakar!\n");

        }


    }

 return 0;
}