<SYSTEM_TASK:>
Given the following text description, write Python code to implement the functionality described.
<END_TASK>
<USER_TASK:>
Description:
Pair with given product
Set 1 ( Find if any pair exists )
Returns true if there is a pair in arr [ 0. . n - 1 ] with product equal to x . ; Create an empty set and insert first element into it ; Traverse remaining elements ; 0 case must be handles explicitly as x % 0 is undefined behaviour in C ++ ; x / arr [ i ] exists in hash , then we found a pair ; Insert arr [ i ] ; Driver code

<ASSISTANT_TASK:>
Python Code:
def isProduct(arr , n , x ) : 
	 if n < 2 : 
	 return False 
  s = set() 
 for i in range(0 , n ) : 
	 if arr[i ] == 0 : 
	 if x == 0 : 
	 return True 
  else : 
	 continue 
   if x % arr[i ] == 0 : 
	 if x // arr[i ] in s : 
	 return True 
  s . add(arr[i ] ) 
   return False 
  if __name__== "__main __": 
	 arr =[10 , 20 , 9 , 40 ] 
 x = 400 
 n = len(arr ) 
 if isProduct(arr , n , x ) : 
	 print("Yes ") 
  else : 
	 print("No ") 
  x = 190 
 if isProduct(arr , n , x ) : 
	 print("Yes ") 
  else : 
	 print("No ") 
  
<END_TASK>
