Minimum Cost to Move Chips to The Same Position

class Solution:
    def minCostToMoveChips(self, position: List[int]) -> int:
        odd = 0
        for i in position:
            odd += i % 2
        return min(odd, len(position) - odd)