#include <stdio.h>
#include <array>
#include <algorithm>

#define FOR(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
#define REP(i, n) FOR(i, 0, n)

constexpr int N = 1e5;
std::array<int, N> A;
std::array<std::array<int, 2>, N> DP;



int main(void){
    int n; scanf("%d", &n);
    REP(i, n) scanf("%d", &A[i]);
    DP[0][0] = 0; DP[0][1] = 1;
    for(int x = 1; x < n; ++x){
        if(A[x-1] == A[x]){
            DP[x][0] = DP[x-1][1];
            DP[x][1] = DP[x-1][1] + 1;
        }
        else{
            DP[x][0] = DP[x-1][1];
            DP[x][1] = DP[x-1][0] + 1;
        }
    }
    printf("%d\n", std::max(DP[n-1][0], DP[n-1][1]));
    return 0;
}