input: Write a python function that checks if the length of a given string is a prime number and returns True if it is, or False if it is not.
  assert prime_length('Hello') == True
  assert prime_length('abcdcba') == True
  assert prime_length('kittens') == True
  assert prime_length('orange') == False
  assert prime_length('wow') == True
  assert prime_length('world') == True
  assert prime_length('MadaM') == True
  assert prime_length('Wow') == True
  assert prime_length('') == False
  assert prime_length('HI') == True
  assert prime_length('go') == True
  assert prime_length('gogo') == False
  assert prime_length('aaaaaaaaaaaaaaa') == False
  assert prime_length('Madam') == True
  assert prime_length('M') == False
  assert prime_length('0') == False
output: def prime_length(s):
      def is_prime(n):
          if n <= 1:
              return False
          if n <= 3:
              return True
          if n % 2 == 0 or n % 3 == 0:
              return False
          i = 5
          while i * i <= n:
              if n % i == 0 or n % (i + 2) == 0:
                  return False
              i += 6
          return True
      
      return is_prime(len(s))