Killjee has an array $A$ containing $N$ integers {1,2,3,4}. Killjee wants to know how many minimum changes he has to do such that the new array has no two adjacent integers are same.

In 1 change you can change any integer to any number >=1 and <=4.

INPUT

First line of input contains a single integer $N$, second line contains $N$ space separated integer elements of array $A$.

OUTPUT

Print single integer, minimum number of changes you need to do.

CONSTRAINTS

$1 \le N \le 10^5$

$1 \le A_{i} \le 4$