#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N,M,Q;
int A[SIZE],DP[SIZE][2];
int MOCHI=0, ZUNDA=1;

void solve() {
    cin>>N;
    REP(i,N)cin>>A[i];
    DP[0][MOCHI] = 0;
    DP[0][ZUNDA] = 1;
    REP(i,N-1) {
        DP[i+1][MOCHI] = max(DP[i][MOCHI], DP[i][ZUNDA]);
        DP[i+1][ZUNDA] = DP[i][MOCHI] + 1;
        if (A[i+1]==A[i]) {
            DP[i+1][ZUNDA] = max(DP[i+1][ZUNDA], DP[i][ZUNDA]+1);
        }
    }
    cout << max(DP[N-1][MOCHI], DP[N-1][ZUNDA]) << endl;
}