you are given an array A of n integers .count the number of nonempty subsets of A such that the product of number in the subset is of the form p1*p2*p3*...*pk where p1,p2,p3,p4.... are a distinct prime number.

where

N<=10^4 A[i]<=30