[Python3] Brute-Force - Simple Solution
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: $$O(32)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(32)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def minChanges(self, n: int, k: int) -> int:\n        bitn, bitk = bin(n).replace("0b", "")[::-1], bin(k).replace("0b", "")[::-1]\n        if len(bitk) > len(bitn): return -1\n        res = 0\n        for i in range(len(bitn)):\n            if i >= len(bitk):\n                if bitn[i] == "1": res += 1\n                continue\n            if bitn[i] == bitk[i]: continue\n            if bitn[i] == "0": return -1\n            res += 1\n        return res\n```
['Math', 'Python3']