simple solution -> python , TC - log(n), SC - O(1)
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```python3 []\nclass Solution:\n    def minChanges(self, n: int, k: int) -> int:\n        if n|k != n:\n            return -1\n        count = 0\n        while n>0:\n            if (n&1) == 1 and (k &1) ==0:\n                count += 1\n            n = n >> 1\n            k = k >> 1\n        return count\n```
['Python3']