You are given an integer array position representing the positions of multiple chips, where position[i] denotes the position of the chip at index i.

You need to move all the chips to the same position. In a single move, you can change the position of any chip from $x$ to:

• $x + 2$ or $x - 2$ with a cost of $0$.

• $x + 1$ or $x - 1$ with a cost of $1$.

Return the minimum total cost required to move all chips to the same position.

Constraints:

• $1 \leq$ position.length $\leq 100$

• $1 \leq$ position[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.