input: Write a function to determine if a given number is prime or composite. If the number is prime, return "Number is Prime"; otherwise, return "Number is Composite".
  assert is_prime(10)=="Number is Composite"
  assert is_prime(7)=="Number is Prime"
  assert is_prime(1)=="Number is Composite"
  assert is_prime(2)=="Number is Prime"
  assert is_prime(17)=="Number is Prime"
output: def is_prime(n):
      if n <= 1:
          return "Number is Composite"
      for i in range(2, int(n**0.5) + 1):
          if n % i == 0:
              return "Number is Composite"
      return "Number is Prime"