Count the number of non-empty subsets S of A such that the product of numbers in that subset is of the form p1*p2*p3*...pk where p1*p2*p3*...pk are distinct prime numbers.\n**NOTES**\n* prime numbers are those that are greater than 1 and have only two factors 1 and itself.\n* an array B is asubset of an array A if each element B is present in A and there are no repeated elements in B.\n##### Example\nassumptions:\n* N=4 \n*  A=[4,2,3,15]\n\n  Approach\n * for subset [2] :product=2\n * for subset [3] :product=3\n * for subset [2,3]product=6(2*3)\n * for subset [2,15]: product=30(2*3*5)\n * for subset [15] :product=15(3*5)\n \n hence in total 5 subsets exist. thus answer is 5\n **Constraints**\n 1<=N<=10000\n 1<=A[i]<=30

Count the number of non-empty subsets S of A such that the product of numbers in that subset is of the form p1p2p3...pk where p1p2p3...pk are distinct prime num