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

int main() { 
    int n; cin >> n; 
    vector<int> nums(n), check(n + 1); 
    for (int i = 0; i < n; i++) { 
        cin >> nums[i]; 
        check[nums[i]] = i; 
    }
    long long ans = 0; 
    int l = min(check[0], check[1]), r = max(check[0], check[1]); 
    if (check[0] > check[1]) 
        ans = (check[0] - check[1]) * (n - check[0]); 
    else 
        ans = (check[1] - check[0]) * (check[0] + 1); 
    for (int i = 2; i < n; i++) { 
        int idx = check[i], pidx = check[i - 1]; 
        if (l < idx and idx < r) 
            continue; 
        if (idx < l) { 
            ans += (l - idx) * i;  
            l = idx; 
            r = idx; 
        }
        // cout << i << ' ' <<ans << endl; 
    }
    cout << ans + n << endl; 
    return 0; 
}