bac2k21 sb3 1

void divPrim(int n, int &s) {
    s = 0;
    int f = 2;
    while (n > 1) {
        int  p = 0;
        while (n % f == 0) {
            n /= f;
            p++;
        }
        if (p % 2) {
            s += f;
        }
        f++;
    }
}