//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;

ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;

template<typename T>
ostream& operator<<(ostream& os,const vector<T>& v){
    if(v.empty()){
        os<<"{ }";
        return os;
    }
    os<<"{"<<v.front();
    for(auto itr=++v.begin();itr!=v.end();itr++){
        os<<", "<<*itr;
    }
    os<<"}";
    return os;
}

template<typename T_first,typename T_second>
ostream& operator<<(ostream& os,const pair<T_first,T_second>& P){
    os<<"("<<P.first;
    os<<", "<<P.second;
    os<<")";
    return os;
}

int main(){
    int n; cin>>n;
    vector<int> a(n,0);
    rep(i,n) cin>>a[i];
    if(n==1){
        cout<<1<<endl;
        return 0;
    }
    vector<bool> b(n-1,true);
    rep(i,n-1){
        if(a[i]!=a[i+1]) b[i]=false;
    }
    int ans=0;
    rep(i,n-2){
        if(!b[i] && !b[i+1]){
            ans++;
            b[i]=b[i+1]=true;
        }
        else if(!b[i]){
            ans++;
            b[i]=true;
        }
    }
    if(!b[n-2]) ans++;
    cout<<n-ans<<endl;
}