def solution(n): answer = 0 for i in range(2, n+1): for j in range(1, i+1): ## 소수가 아닌경우 if (i % j == 0) & (j not in [1, i]): answer += 1 break return n - 1 - answer