Even and Odd Bit Positions

Given a positive integer n, count how many 1 bits appear at even positions (0, 2, 4, ...) and how many at odd positions (1, 3, 5, ...) in its binary representation. Bits are indexed from 0 starting at the least significant bit. Return [even_count, odd_count].

Examples
Input: 0
Output: [0,0]
Hints

Even and Odd Bit Positions

Given a positive integer n, count how many 1 bits appear at even positions (0, 2, 4, ...) and how many at odd positions (1, 3, 5, ...) in its binary representation. Bits are indexed from 0 starting at the least significant bit. Return [even_count, odd_count].