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

int main(){
    long long i,n,a,b[200010],ans=0;
    set<long long> s;
    cin >> n;
    for(i=1;i<=n;i++){
        cin >> a;
        b[a] = i;
    }
    s.insert(0);
    s.insert(n+1);
    for(i=1;i<=n;i++){
        auto x = s.upper_bound(b[i]);
        auto y = x--;
        ans += i*(*x-b[i])*(b[i]-*(y));
        s.insert(b[i]);
    }
    cout << ans << endl;
}