Given a natural number N. Determine if it is prime. A natural number N is called prime if it has only two divisors: one and the number N itself. As an answer, print "Yes" if the number is prime, "No" otherwise. Solve with a while loop

n = int(input())

def is_prime(n):
  if n == 2 or n == 3:
    return True
  if n%2 == 0 or n%3 == 0 or n<2:
    return False
  div = 5
  while div <= n**.5:
    if n%div == 0 or n%(div+2) == 0:
      return False
    div +=6
  return True
    
if is_prime(n):
  print("Yes")
else:
  print("No")