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

int main() {
    int N;
    cin >> N;
    vector<int>P(N);
    set<int>st;
    for(int i = 0; i < N; i++) {
        cin >> P[i];
        st.insert(i+1);
    }
    long long sum = 0;
    for(int i = N-1; i >= 0; i--) {
        if(st.lower_bound(P[i]) == st.end()) {
            sum -= i+1;
        }
        else if(st.upper_bound(P[i]) != st.end()) {
            sum += i+1;
            st.erase(st.upper_bound(P[i]));
        }
    }
    cout << sum << endl;
}