Minimum Cycles

Given an array of n integers, arr, make the values equal using the minimum number of operations.

$$ Either choose an element and apply the operation:

o If the operation number is odd $($e$.$g$.,$ first, third, fifth,..$),$ then increase the element by $1.$

$$ If the operation number is even $($e$.$g$.,$ second, fourth, sixth,..$),$ then increase the element by $2.$

$$ or do nothing.

Only one element can change in an operation.

Calculate the minimum number of operations required to make all elements equal.

Example

arr$=[1,2,4]$