#include <bits/stdc++.h>

using namespace std;

constexpr int N = 1e5 + 1;

int cnt[N], spawn[N], a[N + 1];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  for (int i = 0; i < n; ++i) cin >> a[i], ++cnt[a[i]];
  a[n] = a[0], a[n + 1] = a[1];
  for (int i = 0; i < n; ++i) {
    spawn[min({a[i], a[i + 1], a[i + 2]})] = 1;
    spawn[max({a[i], a[i + 1], a[i + 2]})] = 1;
  }
  int ans = N;
  for (int i = 1; i < N; ++i) ans = min(ans, n - cnt[i] + 1 - spawn[i]);
  cout << ans << '\n';
}