Problem Statement

Longest Subsequence With Non-Zero Bitwise AND Given an array of positive integers, find the maximum length of a subsequence whose bitwise AND is non-zero. A subsequence preserves the relative order and may delete any elements. Input Format The first line contains `n`. The second line contains `n` positive integers. Output Format Print the maximum possible length. Constraints `1 <= n <= 100000` and `1 <= a[i] <= 10^9`. Example Input: `5` then `7 4 11 8 3` Output: `3` Notes The subsequence `7, 11, 3` has bitwise AND equal to `3`.