giúp mình với ạ mình cần gấp

#define task ""
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int nmax = int(1e6) + 10;

bool check (ll x)
{
    for (ll i = 2; i <= sqrt(x); ++i)
    if (x % i == 0) return false;
    return x > 1;
}
ll lt (ll x)
{
    ll s = 1;
    while (x > 9)
    {
        x /= 10;
        s *= 10;
    }
    return s;
}
bool cjt (ll x)
{
    ll s = lt(x);
    ll m = x;
    while (true)
    {
        if (check(x) == false) return false;
        ll a = x / s;
        x = (x % s) * 10 + a;
        if (x == m) return true;
    }
}
ll n, d = 0;
int main()  
{
  //freopen(task".inp" , "r" , stdin);
  //freopen(task".out" , "w" , stdout);

  ios::sync_with_stdio(false);
  cin.tie(0);
 
  cin >> n;
  for (ll i = 2; i <= n; ++i) if (cjt(i) == true) d++;
  cout << d;
  return 0;
}

import math

def check(x):
    for i in range(2, int(math.sqrt(x)) + 1):
        if x % i == 0:
            return False
    return x > 1

def lt(x):
    s = 1
    while x > 9:
        x //= 10
        s *= 10
    return s

def cjt(x):
    s = lt(x)
    m = x
    while True:
        if not check(x):
            return False
        a = x // s
        x = (x % s) * 10 + a
        if x == m:
            return True

n = int(input())
d = 0
for i in range(2, n + 1):
    if cjt(i):
        d += 1
print(d)

def snt(n):
    if n<2: return False
    for i in range(2,int(n**0.5)+1):
        if n%i==0: return False
    return True
def check(n):
    if n<10:
        return True
    else:
        x=y=len(str(n))
        while x>1:
            s=(n//10)+(n%10)*10**(y-1)
            if snt(s):
                n=s
            else:
                return False
            x-=1
        return True
def sangnt(n):
    x=[True]*(n+1)
    s=[]
    x[0]=x[1]=False
    for i in range(2,int(n**0.5)+1):
        if x[i]:
            for j in range(i*i,n+1,i):
                x[j]=False
    for i in range(n):
        if x[i] and check(i):
            s.append(i)
    return s
n=int(input())
print(len(sangnt(n)))

#include <iostream>
#include <vector>
#include <cmath>
#include <string>

bool snt(int n) {
    if (n < 2) return false;
    for (int i = 2; i <= std::sqrt(n); ++i) {
        if (n % i == 0) return false;
    }
    return true;
}

bool check(int n) {
    if (n < 10) {
        return true;
    } else {
        int x = std::to_string(n).length();
        int y = x;
        while (x > 1) {
            int s = (n / 10) + (n % 10) * std::pow(10, y - 1);
            if (snt(s)) {
                n = s;
            } else {
                return false;
            }
            x -= 1;
        }
        return true;
    }
}

std::vector<int> sangnt(int n) {
    std::vector<bool> x(n + 1, true);
    std::vector<int> s;
    x[0] = x[1] = false;
    for (int i = 2; i <= std::sqrt(n); ++i) {
        if (x[i]) {
            for (int j = i * i; j <= n; j += i) {
                x[j] = false;
            }
        }
    }
    for (int i = 0; i <= n; ++i) {
        if (x[i] && check(i)) {
            s.push_back(i);
        }
    }
    return s;
}

int main() {
    int n;
    std::cin >> n;
    std::cout << sangnt(n).size() << std::endl;
    return 0;
}