from sys import stdin

def main():
    nums = [int(n) for n in stdin]

    primes = list(filter(is_prime, nums))
    print(len(primes))

def is_prime(n):
    if 1 == n:
        return False

    if 2 == n:
        return True

    if 0 == n % 2:
        return False

    for i in range(3, n, 2):
        if not i <= int(n/i):
            break

        if 0 == n % i:
            return False

    return True

if __name__ == '__main__':
    main() from sys import stdin def main():
    nums = [int(n) for n in stdin]

    primes = list(filter(is_prime, nums))
    print(len(primes)) main int(n) for n in stdin for n in stdin n stdin for n in stdin int(n) int n nums = [int(n) for n in stdin] nums [int(n) for n in stdin] primes = list(filter(is_prime, nums)) primes list(filter(is_prime, nums)) list filter(is_prime, nums) filter is_prime nums print(len(primes)) print len(primes) len primes def is_prime(n):
    if 1 == n:
        return False

    if 2 == n:
        return True

    if 0 == n % 2:
        return False

    for i in range(3, n, 2):
        if not i <= int(n/i):
            break

        if 0 == n % i:
            return False

    return True is_prime if 1 == n:
        return False

     1 == n 1 n return False False if 2 == n:
        return True

     2 == n 2 n return True True if 0 == n % 2:
        return False

     0 == n % 2 0 n % 2 n 2 return False False for i in range(3, n, 2):
        if not i <= int(n/i):
            break

        if 0 == n % i:
            return False

     i range(3, n, 2) range 3 n 2 if not i <= int(n/i):
            break

         not i <= int(n/i) i <= int(n/i) i int(n/i) int n/i n i break if 0 == n % i:
            return False

     0 == n % i 0 n % i n i return False False return True True n n if __name__ == '__main__':
    main() __name__ == '__main__' __name__ '__main__' main() main def is_prime(n):
    if 1 == n:
        return False

    if 2 == n:
        return True

    if 0 == n % 2:
        return False

    for i in range(3, n, 2):
        if not i <= int(n/i):
            break

        if 0 == n % i:
            return False

    return True def is_prime(n):
    if 1 == n:
        return False

    if 2 == n:
        return True

    if 0 == n % 2:
        return False

    for i in range(3, n, 2):
        if not i <= int(n/i):
            break

        if 0 == n % i:
            return False

    return True is_prime def main():
    nums = [int(n) for n in stdin]

    primes = list(filter(is_prime, nums))
    print(len(primes)) def main():
    nums = [int(n) for n in stdin]

    primes = list(filter(is_prime, nums))
    print(len(primes)) main
from sys import stdin

def main():
    nums = [int(n) for n in stdin]

    primes = list(filter(is_prime, nums))
    print(len(primes))

def is_prime(n):
    if 1 == n:
        return False

    if 2 == n:
        return True

    if 0 == n % 2:
        return False

    for i in range(3, n, 2):
        if not i <= int(n/i):
            break

        if 0 == n % i:
            return False

    return True

if __name__ == '__main__':
    main()