beats over 97% solution w/o if - else
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def evenOddBit(self, n: int) -> List[int]:\n        pair = [0, 0]\n        i = 0\n        while n:\n            pair[i & 1] += n % 2\n            n >>= 1\n            i += 1\n\n        return pair\n```
['Python3']