#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
using P = pair<int,int>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()

int main(){
    ll n;
    cin >> n;
    vector<int> p(n), pinv(n);
    rep(i,n){
        cin >> p[i]; p[i]--;
        pinv[p[i]] = i;
    }
    ll ans = 0;
    vector<bool> used(n,false);
    rep(i,n-1){
        if(pinv[n-1-i] < pinv[n-2-i]){
            ans -= (pinv[n-i-1] + 1) * 2;
            ans += (n-i+1) * (n-i) / 2;
        }
    }
    cout << ans << endl;
    return 0;
}