#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define rep(i,s,n) for(ll i = (s); i < (n); i++)
#define rep0(i,n) rep(i,0,n)
#define rep1(i,n) rep(i,1,n+1)
#define repR(i,s,n) for(ll i = (n-1); i >= (s); i--)
#define repR0(i,n) repR(i,0,n)
#define repR1(i,n) repR(i,1,n+1)

#define BR "\n"
#define SP " "
#define SHOW(x) for(int i = 0; i < x.size(); i++) { cout << x[i] << SP; } cout << BR;
#define SHOW2(x) for(int j = 0; j < x.size(); j++) { SHOW(x[j]); } cout << BR;
#define fcout cout << fixed << setprecision(18)

int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

int a[100];
int cells[100][100]; // r * c

int main() {
  ll N;
  cin >> N;

  vector<ll> A(N);
  rep0(i, N) cin >> A[i];

  vector<vector<ll>> dp(2, vector<ll>(N, 0));

  dp[0][0] = 0;
  dp[1][0] = 1;

  rep(i, 1, N) {
    dp[0][i] = max(dp[0][i - 1], dp[1][i - 1]);
    if(A[i] == A[i - 1]) {
      dp[1][i] = max(dp[0][i - 1] + 1, dp[1][i - 1] + 1);
    } else {
      dp[1][i] = max(dp[0][i - 1] + 1, dp[1][i - 1]);
    }
  }

  cout << max(dp[0][N - 1], dp[1][N - 1]) << BR;
  return 0;
}