#include <bits/stdc++.h>

using namespace std;

#define int long long

struct BIT
{
    const int n;
    vector<int> tree;
    BIT(int n) : n(n), tree(n + 1) {};
    // 询问前x个数的和
    int Query(int x)
    {
        int res = 0;
        for (int i = x; i > 0; i -= (i & -i)) res += tree[i];
        return res;
    }
    // 第l个位置+z
    void Modify(int l, int z)
    {
        if (l <= 0) return;
        for (int i = l; i <= n; i += (i & -i)) tree[i] += z;
    }
    // 区间求和
    int rangeQuery(int l, int r)
    {
        return Query(min(n, r)) - Query(max(0ll, l - 1));
    }
};

void solve()
{
    int n; cin >> n;
    vector<int> a(n + 1), pos(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        pos[a[i]] = i;
    }
    vector<vector<int>> mem(n + 1);
    vector<bool> st(n + 1);
    for (int i = 1; i <= n; i++)
    {
        int t = pos[a[i] - 1] + 1;
        if (i >= t)
        {
            mem[t].push_back(i);
            st[a[i]] = true;
        }
    }
   /* for (int i = 1; i <= n; i++)if (st[a[i]])cout << a[i] << endl;*/
    BIT bit(n);
    int ans = 0;
    for (int i = 1; i <= n; i++)
    {
        for (auto t : mem[i]) {
            bit.Modify(a[t], 1);//
            cout << a[t] << ' ';
        }
        
        if (st[a[i]]) {
            bit.Modify(a[i], -1);//
            cout <<"a[i] = " << a[i] << ' ';
        }
        if (a[i - 1] + 1 <= a[i] - 1) {
            ans += bit.rangeQuery(a[i - 1] + 1, a[i] - 1);
            cout <<"a[i-1]+1=" << a[i - 1] + 1 << " a[i]-1=" << a[i] - 1;
        }
        cout << endl;
    }
    cout << ans << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}