Minimum moves

You want to send $N$ data packets, each containing $a_i$ bits of data where $a_i$ denotes the size of each packet. The size of each packet must be a power of $2.$

To ensure that the transfer of data happens in packets whose size is a power of $2,$ you can perform operations on the packet sizes. In a single operation, you can select a packet and either remove a bit or add one bit to it$.$ This is denoted as $a_i=a_i-1$ or $a_i=a_i+1.$

Determine the minimum number of operations required to transform all packet sizes into a power of $2.$

Function description

Complete the solve$)$ function. This function takes two parameters and returns a single integer denoting the answer to the question.

N: Represents the number of data packets

$a$ : Represents the array denoting the size of each data packet

Input format for custom testing

Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code.

The first line contains an integer $N,$ denoting the number of data packets.

The second line contains $N$ space$-$separated integers denoting the size of each data packet.