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:

$$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]$

Operation Operation type Resulting arr

Number

$1$ Choose the $1$ st element $[2,2,4]$

and add $1$ since operation

number is odd.

$2$ choose the $2$nd element and $[2,4,4]$

add $2$

$3$ skip this day $[2,4,4]$

$4$ choose the $1$st element and $[2,4,4]$

add $1$

the minimum operations required is $4$

Function Description

Complete the function minimumCycles in the editor below.

minimumCycles has the following parameter:

int arr$[$n$]$: the integers to equalize

Returns

long: the minimum number of operations required to equalize the array

Constraints

$1<=$ n$<=2*10^5$

$1<=$ arr$[$i$]<=10^9$

Input Format For Custom Testing

The first line contains an integer n$,$ the size of arr.

arr$[$i$].$

Each of the next n lines contains an integer arr$[$i$]$

# Complete the 'minimumCycles' function below.

#

# The function is expected to return a LONG$\_$INTEGER.

# The function accepts INTEGER$\_$ARRAY arr as parameter.

#

def minimumCycles$($arr$)$ :

# Write your code here

if $\_\_$name$\_\_==\text{'}\_\_$main$\_\_\text{'}$:

fptr $=$ open $($os$.$ environ $[\text{'}$OUTPUT$\_$PATH'$],\text{'}$w$\text{'})$

arr$\_$count $=$ int$($input $().$strip$())$

arr $=[]$

for $\_$ in range $($arr$\_$count$)$ :

arr$\_$item $=$ int$($input$().$ strip $())$

arr. append $($arr$\_$item$)$

result $=$ minimumCycles $($arr$)$

fptr$.$ write$($str $($result$)+\text{'}$

$\text{'})$

fptr$.$ close $()$