#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N];
long long f[N];
int main(void)
{
    int n; cin >> n;
    for(int i = 1 ; i <= n ; ++ i )cin >> a[i];
    vector<int>vc;
    vc.push_back(n);
    for(int i = n - 1 ; i >= 1 ; -- i )if(a[i] > a[vc.back()])vc.push_back(i);
    int k = 0;
    for(int i = 1 ; i <= n ; ++ i ){
        if(k < vc.size() && i > a[vc[k]]){ ++ k; }
        if(k < vc.size())f[i] = f[i - 1] + vc[k];
    }
    long long res = 0;
    for(int i = 1 ; i <= n ; ++ i )res = res + f[a[i]];
    cout << res << endl;
    return 0;
}