#include <bits/stdc++.h>
using namespace std;

#ifdef CKISEKI
#define all(x) begin(x), end(x)
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m(" << s << ") = (";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [";
    while (L != R) cerr << " " << *L++;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif

class BIT {
    int n;
    vector<int> a;
    static int lowbit(int x) { return x & (-x); }
    int query(int p) {
        int r = 0;
        while (p) {
            r += a[p];
            p -= lowbit(p);
        }
        return r;
    }
public:
    BIT(int n_) : n(n_), a(n) {}
    void add(int p, int v) {
        while (p < n) {
            a[p] += v;
            p += lowbit(p);
        }
    }
    int query(int l, int r) {
        return query(r) - query(l);
    }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> a(n);
    for (int &ai : a)
        cin >> ai;
    map<int, vector<int>> m;
    for (int i = 0; i < n; ++i)
        m[a[i]].push_back(i);

    BIT bit(n + 1);
    for (int i = 1; i <= n; ++i)
        bit.add(i, -1);
    int ans = 0;
    for (const auto &[_, v] : m) {
        bool good = false;
        int pre = 0;
        for (int p : v) {
            bit.add(p + 1, 2);
            if (bit.query(0, p + 1) - pre > 0)
                good = true;
            pre = min(pre, bit.query(0, p));
        }
        ans += good;
        for (int p : v)
            bit.add(p + 1, -2);
    }
    cout << ans << '\n';
    return 0;
}