Question asked :
Problem: We are familiar with primes. Here we define omega prime.
A number X is an omega prime such that any perfect square of Y (Y > 1) doesn't divide X, such as 2 and 6 are omega primes while 12 is not an omega prime since it can be divided by 2*2. Now we are given an array A of integers, we need to find out the total number of subsets such that the product of elements of the subset is omega prime. The answer can be huge, hence output modulo 1000000007.
1 <= A.size() <= 2 * (10^4)
1 <= A[i] <= 30