Size of subset of an array with largest bitwise AND product?

Question

If given an array A consisting of N integers, how can I return the size of the largest possible subset of A such that its AND product is greater than 0???

Any help is