#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    int N;
    cin >> N;
    int A[N];
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    int dp[N + 1]{};
    dp[1] = 1;
    for (int i = 1; i < N; i++) {
        if (A[i - 1] == A[i]) {
            dp[i + 1] = max(dp[i], dp[i]) + 1;
        } else {
            dp[i + 1] = max(dp[i], dp[i - 1] + 1);
        }
    }
    cout << dp[N] << "\n";
    return 0;
}