There are n coins on the table. Some of them have heads up, and some of them have tails up. Find the minimum number of coins to reverse, so that all coins will be turned up with the same side.

Input

The first line contains number of coins n (1 ≤ n ≤ 100). Each of the next n lines contains one integer: 1 if the coin is tails up or 0 if heads up.

Output

Print the minimum number of coins to reverse.