#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

int dp[100010][2];

int main(){
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i,n) cin >> a[i];
  dp[0][0] = 0;
  dp[0][1] = 1;
  rep(i,n-1) {
    if (a[i] == a[i+1]) {
      dp[i+1][0] = max(dp[i][0], dp[i][1]);
      dp[i+1][1] = max(dp[i][0], dp[i][1]) + 1;
    } else {
      dp[i+1][0] = max(dp[i][0], dp[i][1]);
      dp[i+1][1] = dp[i][0] + 1;
    }
  }
  cout << max(dp[n-1][0], dp[n-1][1]) << endl;
  return 0;
}