#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(12);
  }
}init;

template <typename T, typename Container=vector<T>> vector<tuple<T,int64_t,int64_t>> run_length_encode(const Container &v){
  vector<tuple<T,int64_t,int64_t>> ret;

  int i = 0;

  for(auto &x : v){
    if(ret.empty()) ret.push_back({x,i,1});
    else if(get<0>(ret.back()) == x) ++get<2>(ret.back());
    else ret.push_back({x,i,1});

    ++i;
  }

  return ret;
}




int main(){
  int N;
  while(cin >> N){
    vector<int> a(N); cin >> a;
    vector<bool> check(N);

    auto r = run_length_encode<int>(a);
    sort(ALL(r), [](const auto &a, const auto &b){return get<1>(a) > get<1>(b);});
    

    for(auto &[x,s,len] : r){
      

      FOR(i,s,s+len){
        bool f = true;
        if(i-1 >= 0 and check[i-1] and a[i-1] != x) f = false;
        if(i+1 < N and check[i+1] and a[i+1] != x) f = false;

        if(f){
          check[i] = true;
        }
      }
    }
    

    

    int ans = 0;
    REP(i,N) if(check[i]) ++ans;

    cout << ans << endl;
  }


  return 0;
}