Count Square-Free Subsets

Given a positive integer array, find the number of square-free non-empty subsets of the array. A subset is considered square-free if the product of its elements is a square-free integer. Print the count.