def count_Primes_nums(n):
    
    ctr = 0
    for num in range(n):
        if num <= 1:
            continue
        for i in range(2,num):
            if (num % i) == 0:
                break
        else:
            ctr += 1
    return ctr
def count_Primes_nums(n):
    ctr = 0
    for i2 in range(n):
        if i2 <= 1:
            continue
           
        for i in range(2, i2):
            if (i2 % i) == 0:
                break
        else:
            ctr += 1
    return ctr