#include <bits/stdc++.h>
using namespace std;
int solve(vector<int> nums, int n){
int i=0,j=0,ans=0;
while(i<n && j<n){
int temp = nums[j];
int count =0;
while(j<n && nums[j]==temp){
j++;
count ++;
}
if(count == 1){
nums[i] = temp;
i++;
count--;
}
else if(count == 2)
{
nums[i++] = temp;
nums[i++] = temp;
count=count-2;
}
else
{
nums[i++] = temp;
nums[i++] = temp;
count = count-2;
}
ans+=count;
}
return (n-ans);
}
int main()
{
int n;
cin>> n;
vector<int>nums(n);
for(int i=0;i<n;i++)
cin>>nums[i];
solve(nums,n);
cout<<solve(nums,n);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgc29sdmUodmVjdG9yPGludD4gbnVtcywgaW50IG4pewoJaW50IGk9MCxqPTAsYW5zPTA7Cgl3aGlsZShpPG4gJiYgajxuKXsKCQlpbnQgdGVtcCA9IG51bXNbal07CgkJaW50IGNvdW50ID0wOwoJCXdoaWxlKGo8biAmJiBudW1zW2pdPT10ZW1wKXsKCQkJaisrOwoJCQljb3VudCArKzsKCQl9CgkJaWYoY291bnQgPT0gMSl7CgkJCW51bXNbaV0gPSB0ZW1wOwoJCQlpKys7CgkJCWNvdW50LS07CgkJfQoJCWVsc2UgaWYoY291bnQgPT0gMikKCQl7CgkJCW51bXNbaSsrXSA9IHRlbXA7CgkJCW51bXNbaSsrXSA9IHRlbXA7CgkJCWNvdW50PWNvdW50LTI7CgkJfQoJCWVsc2UKCQl7CgkJCW51bXNbaSsrXSA9IHRlbXA7CgkJCW51bXNbaSsrXSA9IHRlbXA7CgkJCWNvdW50ID0gY291bnQtMjsKCQl9CgkJYW5zKz1jb3VudDsKCX0KCXJldHVybiAobi1hbnMpOwp9CgppbnQgbWFpbigpCnsKCWludCBuOwoJY2luPj4gbjsKCXZlY3RvcjxpbnQ+bnVtcyhuKTsKCWZvcihpbnQgaT0wO2k8bjtpKyspCgljaW4+Pm51bXNbaV07Cglzb2x2ZShudW1zLG4pOwoJY291dDw8c29sdmUobnVtcyxuKTsKCXJldHVybiAwOwp9