Omega Primes

Problem Statement

Omega Primes Problem Description Carl is bored of playing with ordinary prime numbers. Thus, he comes up with some special numbers called Omega Primes. A number X is called Omega Prime, if there exists no perfect square Y (Y > 1) such that Y divides X. For example, 6 is an Omega Prime because there is no perfect square except 1 that divides 6. On the other hand, 12 is not an Omega Prime as 4 (which is a perfect square) is a divisor of 12. Carl decides to play a bit more with Omega Primes. He has an array A of integers. Carl wants to find the number of different subsets such that the product of elements for each subset, results in an Omega Prime. Help Carl find this number. Since this number can be large, output the answer modulo 10 9 + 7. Constraints 1 4 1 Input Format The first argument is the integer array A. Output Format Return an integer denoting the number of different desired subsets modulo 10 9 + 7. Examples Example 1: Input 1: A = [2, 4, 3] Output 1: 3 Explanation: The differe