BOJ1978-소수 찾기 (python3)

쉬웠다!

import sys

n = int(sys.stdin.readline().rstrip('\n'))
n_list = list(map(int,sys.stdin.readline().rstrip('\n').split()))
isPrime = True
result = 0
for i in n_list:
    isPrime = True
    for j in range(2,i):
        if i%j == 0:
            isPrime = False
            break
    if i!=1 and isPrime: result += 1

print(result)