#include <bits/stdc++.h>

using namespace std;

#define maxn 2000000 + 1000

typedef pair<int, int> Node;

int a[maxn], l[maxn], r[maxn];

int sum[maxn], num[maxn];

set<Node> flag;

priority_queue<Node> q;

int main()

{

        int n, tot = ;

        scanf("%d", &n);

        for (int i = ; i <= n; i++) scanf("%d", &a[i]);

        int tmp = ;

        for (int i = ; i <= n; i++)

                if (a[i] == a[i+]) tmp++;

                    else sum[++tot] = tmp, num[tot] = a[i], tmp = ;

        for (int i = ; i <= tot; i++)

                l[i] = i-, r[i] = i+, q.push(Node(sum[i], -i));

        int ans = ;

        while(!q.empty())

        {

                int len = q.top().first, index = -q.top().second;

                q.pop();

                if (flag.count(Node(len, -index))) continue;

                ans++;

                int left = l[index], right = r[index];

                if (left >=  && right <= tot && num[left] == num[right])

                {

                        flag.insert(Node(sum[left], -left));

                        flag.insert(Node(sum[right], -right));

                        sum[left] += sum[right];

                        q.push(Node(sum[left], -left));

                        r[left] = r[right];

                        l[r[right]] = left;

                }

                else

                        r[left] = right, l[right] = left;

        }

        printf("%d\n", ans);

}