Count_of_the_non-prime_divisors_of_a_given_number.py

n=int(input())
s=0
for i in range(1,n+1):
    if(n%i==0):
        c=0
        for j in range(1,i+1):
            if(i%j==0):
                c+=1
        if(c!=2):
            s+=1
print(s)