input: Write a function to determine if a given list of integers contains only prime numbers after removing a single element. Return True if it is possible to remove one element such that the remaining list contains only prime numbers, otherwise return False.
  assert remove_one_prime([7, 8, 23])==True
  assert remove_one_prime([7, 12, 19])==False
  assert remove_one_prime([1, 2, 4, 6])==False
  assert remove_one_prime([23, 29, 31, 11])==True
  assert remove_one_prime([23, 25, 29])==True
output: def remove_one_prime(nums):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, int(n**0.5) + 1):
              if n % i == 0:
                  return False
          return True
      
      for i in range(len(nums)):
          new_list = nums[:i] + nums[i+1:]
          if all(is_prime(x) for x in new_list):
              return True
      return False