# Switch

Time Limit: 1 Second Memory Limit: 32768 KB

There are N lights in a line. Given the states (on/off) of the lights, your task is to determine at least how many lights should be switched (from on to off, or from off to on), in order to make the lights on and off alternatively.## Input

One line for each testcase.

The integer N (1 <= N <= 10000) comes first and is followed by N integers
representing the states of the lights ("1" for on and "0"
for off).

Process to the end-of-file.

## Output

For each testcase output a line consists of only the least times of switches.

## Sample Input

3 1 1 1 3 1 0 1

## Sample Output

1 0Submit

Source: Zhejiang University 2003 Summer Camp Qualification Contest