Python || 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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\no(n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\no(n)\n\n# Code\n```python3 []\nclass Solution:\n    def minBitwiseArray(self, nums: List[int]) -> List[int]:\n        ans = [0] * len(nums)\n        for i, j in enumerate(nums):\n            b = bin(j)[2:]\n            if b[-1] == \'0\':\n                ans[i] = -1\n                continue\n            count = 0\n            for k in range(-1, -len(b) - 1, -1):\n                if b[k] == \'1\':\n                    count += 1\n                else:\n                    break\n            front = len(b) - count\n            ans[i] = int(b[:front] + \'0\' + (\'1\' * (count - 1)), 2)\n        return ans\n        \n```
['Bit Manipulation', 'Python3']