Segments Removal

每次删除长度最长的最左面的一段连续的数字区间，求删除次数

Vasya has an array of integers of length $ n $ . Vasya performs the following operations on the array: on each step he finds the longest segment of consecutive equal integers (the leftmost, if there are several such segments) and removes it. For example, if Vasya's array is $ [13,13,7,7,7,2,2,2] $ , then after one operation it becomes $ [13,13,2,2,2] $ . Compute the number of operations Vasya should make until the array becomes empty, i.e. Vasya removes all elements from it.

The first line contains a single integer $ n $ ( $ 1<=n<=200000 $ ) — the length of the array. The second line contains a sequence $ a_{1},a_{2},...,a_{n} $ ( $ 1<=a_{i}<=10^{9} $ ) — Vasya's array.

Print the number of operations Vasya should make to remove all elements from the array.

4
2 5 5 2

2

5
6 3 4 1 5

5

8
4 4 4 2 2 100 100 100

3

6
10 10 50 10 50 50

4

In the first example, at first Vasya removes two fives at the second and third positions. The array becomes $ [2,2] $ . In the second operation Vasya removes two twos at the first and second positions. After that the array becomes empty. In the second example Vasya has to perform five operations to make the array empty. In each of them he removes the first element from the array. In the third example Vasya needs three operations. In the first operation he removes all integers $ 4 $ , in the second — all integers $ 100 $ , in the third — all integers $ 2 $ . In the fourth example in the first operation Vasya removes the first two integers $ 10 $ . After that the array becomes $ [50,10,50,50] $ . Then in the second operation Vasya removes the two rightmost integers $ 50 $ , so that the array becomes $ [50,10] $ . In the third operation he removes the remaining $ 50 $ , and the array becomes $ [10] $ after that. In the last, fourth operation he removes the only remaining $ 10 $ . The array is empty after that.