input: Write a python function that determines if a given number is the product of exactly three prime numbers and returns true or false accordingly. Note that the given number will be less than 100.
  assert is_product_of_three_primes(5) == False
  assert is_product_of_three_primes(30) == True
  assert is_product_of_three_primes(8) == True
  assert is_product_of_three_primes(10) == False
  assert is_product_of_three_primes(125) == True
  assert is_product_of_three_primes(3 * 5 * 7) == True
  assert is_product_of_three_primes(3 * 6 * 7) == False
  assert is_product_of_three_primes(9 * 9 * 9) == False
  assert is_product_of_three_primes(11 * 9 * 9) == False
  assert is_product_of_three_primes(11 * 13 * 7) == True
output: def is_product_of_three_primes(n):
      def is_prime(x):
          if x < 2:
              return False
          for i in range(2, int(x ** 0.5) + 1):
              if x % i == 0:
                  return False
          return True
  
      primes = [i for i in range(2, n) if is_prime(i)]
      
      for i in range(len(primes)):
          for j in range(i, len(primes)):
              for k in range(j, len(primes)):
                  if primes[i] * primes[j] * primes[k] == n:
                      return True
      return False