Coins

There are $n$ coins on the table. Some of them are heads-up, while others are tails-up. Determine the minimum number of coins that need to be flipped so that all the coins end up facing the same side up.

Input

The first line contains the number of coins $n(1\le n\le 100)$. Each of the following $n$ lines contains an integer: $1$ if the coin is heads-up, and $0$ if it is tails-up.

Output

Print the minimum number of coins that need to be flipped.

Examples