You have given an array A having N integers. Let say G is the product of all elements of A.
You have to find the number of distinct prime divisors of G.
The first argument given is an Array A, having N integers.
Return an Integer, i.e number of distinct prime divisors of G.
1 <= N <= 1e5 1 <= A[i] <= 1e5
Input: A = [1, 2, 3, 4] Output: 2 Explanation: here G = 1 * 2 * 3 * 4 = 24 and distinct prime divisors of G are [2, 3]
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.