#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <array>
#include <cstring>
#include <cstdlib>
#include <cmath>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    vector<array<int, 2>> dp(n);
    dp[0][0] = 0;
    dp[0][1] = 1;
    for (int i = 1; i < n; i++) {
        int t = max(dp[i - 1][0], dp[i - 1][1]);
        dp[i][0] = t;
        if (a[i] == a[i - 1]) {
            dp[i][1] = t + 1;
        } else {
            dp[i][1] = dp[i - 1][0] + 1;
        }
    }

    cout << max(dp[n - 1][0], dp[n - 1][1]) << endl;

    return 0;
}