Father's Footsteps

Claudio works hard and enjoys helping others. Over the years, he has learned many skills: he can work as a farmhand, carpenter, engineer, mechanic, gravedigger, businessman, or neighborhood bar owner. Whatever the job, he does it exceptionally well, even without formal training.

Today he has $N$ jobs to do, in a fixed order, and each job requires a specific skill. Claudio needs to change tools whenever two consecutive jobs in his schedule require different skills. Notice that preparing the tools for his first job does not count as a tool change.

Claudio’s son is following in his footsteps and wants to practice one of the skills. The son can choose any skill and perform all jobs requiring that skill. These jobs are removed from Claudio’s schedule, while the order of all remaining jobs stays the same.

When choosing a skill to practice for the day, Claudio’s son wants to help his father as much as possible, minimizing the number of tool changes that Claudio will need for the remaining jobs. What is this minimum number?

Input

The first line contains an integer $N$ ($1 \leq N \leq 2 \times 10^{5}$) indicating the number of jobs.

The second line contains $N$ integers ${A_1}, {A_2}, \ldots, {A_N}$ ($1 \leq A_i \leq N$), where $A_i$ is the skill required for the $i$-th job.

Output

Output a single line with an integer representing the minimum possible number of tool changes.

8
1 2 1 2 2 3 2 1

2

2
1 2

0

5
3 3 3 3 3

0