helppppppppppppppppp

`color(#5C73B9ff)(H)color(#6B68C0ff)(o)color(#795DC6ff)(r)color(#8852CDff)(i)color(#9646D4ff)(z)color(#A53BDAff)(o)color(#B330E1ff)(n)`

#include <bits/stdc++.h>
using namespace std;

int main() {
    long n, dem = 0; cin >> n;
    for (int i = 1; i <= n; i++) {
        int uoc = 0;
        for (int j = 1; j <= i; j++)
            if (i % j == 0) uoc += j;

        bool snt = true;

        for (int j = 2; j <= sqrt(uoc); j++)
            if (uoc % j == 0) snt = false;
            
        if (snt && i != 1) dem++;
    }
    cout << dem;
    return 0;
}

#danglam228

#include <bits/stdc++.h>
using namespace std;

const int N = 1e7;
int prime[N + 1];
void sang(int res) {
    for (int i = 0; i <= res; ++i) {
        prime[i] = 1; 
    }
    prime[0] = prime[1] = 0;  
    for (int i = 2; i * i <= res; ++i) {
        if (prime[i]) {
            for (int j = i * i; j <= res; j += i) {
                prime[j] = 0;  
            }
        }
    }
}
int tt(int x) {
    int s = 0;
    for (int i = 1; i * i <= x; ++i) {
        if (x % i == 0) {
            s += i;
            if (i != x / i) { 
                s += x / i;
            }
        }
    }
    return s;
}

int main() {
        ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    freopen("priem.inp", "r", stdin);
    freopen("prime.out", "w", stdout);
    int n;
    cin >> n;
    sang(N);
    int count = 0;
    for (int i = 1; i <= n; ++i) {
        int d = tt(i);
        if (d <= N && prime[d]) {
            ++count;
        }
    }

    cout << count << endl;

    return 0;
}