input: Write a function to determine if a number provided by the user is prime or not. The function should return 'Prime' if the number is prime, and 'Not Prime' otherwise. If the number is less than 2, return 'Not Prime'.
  assert is_prime(17) == 'Prime'
  assert is_prime(4) == 'Not Prime'
  assert is_prime(1) == 'Not Prime'
  assert is_prime(2) == 'Prime'
  assert is_prime(29) == 'Prime'
output: def is_prime(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'