easy python solution
\n\n# Code\npython3 []\nclass Solution:\n    def minChanges(self, n: int, k: int) -> int:\n        count =0\n        for i in range(32):\n            nb=n%2\n  
\n\n# Code\n```python3 []\nclass Solution:\n    def minChanges(self, n: int, k: int) -> int:\n        count =0\n        for i in range(32):\n            nb=n%2\n            kb=k%2\n            if (nb==1 and  kb==0):\n                count+=1\n            if (nb==0 and kb==1):\n                return -1\n\n\n            n//=2\n            k//=2\n        return count \n```
['Python3']