1217. Minimum Cost to Move Chips to The Same Position - LeetCode Solution

class Solution:
    def minCostToMoveChips(self, position: List[int]) -> int:
        even = 0
        odd = 0
        
        for pos in position:
            if pos%2 == 0:
                even+=1
            else:
                odd+=1
        if odd >=even:
            a = 1
        else:
            a = 0
        ans=0
        for pos in position:
            if pos%2 == a:
                continue
            else:
                ans+=1
                
        return ans