input: Write a function to determine if a given number is prime. If the number is prime, return "Prime"; otherwise, return "Not Prime". If the given number is less than 2, return "Not Prime".
  assert prime_check(17) == "Prime"
  assert prime_check(4) == "Not Prime"
  assert prime_check(1) == "Not Prime"
  assert prime_check(29) == "Prime"
  assert prime_check(2) == "Prime"
output: def prime_check(n):
      if n < 2:
          return "Not Prime"
      for i in range(2, int(n**0.5) + 1):
          if n % i == 0:
              return "Not Prime"
      return "Prime"