#pragma once

#include <bits/stdc++.h>

//https://atcoder.jp/contests/abc140/tasks/abc140_e
//n x n では間に合わない
//各要素が2番目に大きくなる組み合わせを調べて数え上げていく

#define M_PI       3.14159265358979323846   // pi

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;

#define rep(a,n) for(int a = 0;a < n;a++)
#define repi(a,b,n) for(int a = b;a < n;a++)

const ull mod = 1e9+7;

int main(void)
{
	ll n;
	cin >> n;
	vector<ll> vs(n+1, 1e7);
	rep(i, n) cin >> vs[i+1];

	vector<vector<ll>> dp(n + 1, vector<ll>(2,0));
	dp[0][0] = 0;
	dp[0][1] = 0;
	rep(i, n) {
		dp[i + 1][0] = max(dp[i][0], dp[i][1]);
		dp[i + 1][1] = dp[i][0] + 1;
		if (vs[i + 1] == vs[i]) 
		{
			dp[i + 1][1] = max(dp[i+1][1], dp[i][1] + 1);
		}
	}
	cout << max(dp[n][0], dp[n][1]) << endl;
	return 0;
}