#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n; cin >> n;
    vector<int> a(n);
    for (int& x : a) {
        cin >> x;
        --x;
    }

    set<tuple<int, int, int>> q;
    q.emplace(0, n - 1, 0);
    long long ans = 0;
    for (int x : a) {
        auto it = prev(q.upper_bound(make_tuple(x, INT_MAX, 0)));
        auto [l, r, s] = *it;
        q.erase(it);
        ans += s;
        if (l <= x - 1) {
            q.emplace(l, x - 1, s + 1);
        }
        if (x + 1 <= r) {
            q.emplace(x + 1, r, s + 1);
        }
    }
    cout << ans << "\n";
}

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

    solve();

    return 0;
}