def prime(n):
cnt = 0
for i in range(1,n+1):
if i % 1 == 0 :
cnt += 1
if cnt == 2:
return 1
else:
return 0