text: """
  1217
  easy
  Minimum Cost to Move Chips to The Same Position
  
  We have n chips, where the position of the ith chip is position[i].
  
  We need to move all the chips to the same position. In one step, we can
  change the position of the ith chip from position[i] to:
  
  position[i] + 2 or position[i] - 2 with cost = 0.
  position[i] + 1 or position[i] - 1 with cost = 1.
  
  
  Return the minimum cost needed to move all the chips to the same position.
  
  """
  
  from typing import List
  
  
  class Solution:
      def minCostToMoveChips(self, position: List[int]) -> int:
          even = odd = 0
          for i in position:
              if i % 2 == 0:
                  even += 1
              elif i % 2 == 1:
                  odd += 1
          return min(even, odd)
  
  
  
  
  
  
  