We are given an array nums of positive integers.
A special number is a number that is not divisible by the square of any number(>1).
Example:
12 is not a special number, because it is divisible by 4(which is 22).
18 is not a special number, because it is divisible by 9(which is 32).
35,6,15 are special numbers.
You have to find the number of the non-empty different subsets of the array such that the product of elements in it is a special number. Return answer modulo 109+7.
Input format
Output format
Constraints
[2,3], [2,3], [2], [2], [3] are the possible subsets. So the answer is 5.