#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 7;
bool Check(int n)
{
    while (n > 0)
    {
        if ((n % 10) == 3 || (n % 10) == 5 ||  (n % 10) == 7) return false;
        n /= 10;
    }
    return true;
}
signed main()
{
    vector<int> Sang(N, 1);
    vector<int> DayNT;
    Sang[0] = Sang[1] = 0;
    for (int i = 2; i * i <= N; i++)
    {
        if (Sang[i] == 1)
        {
            for (int j = i * i; j <= N; j += i) Sang[j] = 0;
        }
    }

    for (int i = 2; i <= N; i++)
    {
        if (Sang[i] == 1) DayNT.push_back(i);
    }
    int n; cin >> n;
    int s = 0;
    for (int x : DayNT)
    {
        if (x > n) break;
        if (Check(x)) s++;
    }
    cout << s;
}

$#doanthevu$

Code C++:

#include <bits/stdc++.h>
#define ll long long
using namespace std;
bool qq(ll n) {
    if (n <= 1) return false;
    for (ll i = 2; i * i <= n; i++) {
        if (n % i == 0) return false;
    }
    return true;
}
bool vv(ll n) {
    string s = to_string(n);
    return qq(n) && s.find('3') == string::npos && s.find('5') == string::npos && s.find('7') == string::npos;
}
void bb(ll N, ll& result) {
    result = 0;
    for (ll i = 1; i <= N; i++) {
        if (vv(i)) {
            result++;
        }
    }
}
int main() {
    ll N;
    cin >> N;
    ll result = 0;
    bb(N, result);
    cout <<  result << endl;
    return 0;
}