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.
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"
Process to the end-of-file.
For each testcase output a line consists of only the least times of switches.