Please solve the programming task below using a self-contained code snippet in a markdown code block.

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.
 
Please complete the following python code precisely:
```python
class Solution:
    def minCostToMoveChips(self, position: List[int]) -> int:
```