A combination of numbers has a bitwise AND greater than zero exactly when all of them share at least one common set bit. Given an array of positive integers, return the size of the largest such combination.
Input: A JSON object {"candidates": [<positive integers>]}.
Output: Return the maximum number of elements sharing a common set bit.
Input: {"candidates":[16,17,71,62,12,24,14]}
Output: 4
Explanation: The most shared bit appears in four numbers -> 4.Input: {"candidates":[8,8]}
Output: 2
Explanation: Both share the same bit -> 2.1 <= len(candidates) <= 10^51 <= candidates[i] < 2^24