#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <iomanip>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;

int main()
{
  int N; cin >> N;
  vector<ll> A(N); for(int i = 0; i < N; ++i) cin >> A[i];
  bool black = true;
  ll ans = 0;
  for(int i = 0; i < N; ++i) {
    if(black) {
      ++ans;
      while(A[i] == A[i+1]) {
        ++i; ++ans;
      }
      black = false;
    } else {
      black = true;
    }
  }
  cout << ans << endl;
  return 0;
}