beautifulNumber

#include<iostream>
#include<cmath>
using namespace std;

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

int beautifulNumber(int n){
    int i=1, a[100005];
    int r = n%10;
    n/=10;
    a[0] = r;
    while(n > 0){
        int t = n % 10;
        if(t == r) return 0;
        n/=10;
        a[i++]=t;
    }
    int check1 = 0, check2 = 0;
    for(int j = 1; j <= i; j++){
        if(a[i] - a[i-1] > 0) check1 = 1;
        if(a[i] - a[i-1] < 0) check2 = 1;
    }
    if(check1 == 0 && check2 == 1) return 1; //day tang vi mang a dang bi dao nguoc
    if(check1 == 1 && check2 == 0) return 1; //day giam vi mang a dang bi dao nguoc
    return 0;
}

main(){
    int n, count = 0;
    cin>>n;
    for(int i = pow(10, n-1); i < pow(10, n); i++){
        if(beautifulNumber(i) && prime(i)){
            count++;
//          cout<<i<<' ';
        }
    }
    cout<<count;
}