class Solution {
    public int minCostToMoveChips(int[] position) {
        int[] helper=new int[2];
        
        for(int chip:position)
            helper[chip%2]++;
        
        return Math.min(helper[0], helper[1]);
    }
}