comefrom: <doocs>1217.Minimum Cost to Move Chips to The Same Position_1.py
code: def minCostToMoveChips( position: List[int]) -> int:
      a = sum(p % 2 for p in position)
      b = len(position) - a
      return min(a, b)
masked: def sample_funcname ( var_0 : List [ int ] ) -> int :
      var_6 = sum ( var_4 % 2 for var_4 in var_0 )
      var_8 = len ( var_0 ) - var_6
      return min ( var_6 , var_8 )
  