백준 2581번 소수

python

import math

def find_primenumber(n):
  if n == 1 :
    return 0
  for i in range(2, int(math.sqrt(n) + 1)):
    if n % i == 0:
      return 0
  return n

n1 = int(input())
n2 = int(input())

sum = 0
min_primenumber = 0
for i in range(n1, n2+1):
  if find_primenumber(i) != 0:
    sum += find_primenumber(i)
    if min_primenumber == 0:
      min_primenumber += sum

if sum == 0:
  print(-1)
else:
  print(sum)
  print(min_primenumber)