#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int d[200001];
int main(void){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        int a;
        cin>>a;
        d[a]=i;
    }
    ll ans=0;
    set<ll> s; 
    s.insert(-1),s.insert(n);
    for(int i=0;i<n;i++){
        auto cnt=s.lower_bound(d[i+1]);
        ll l=*cnt;
        cnt--;
        ll r=*cnt;
        ans+=(i+1)*(l-d[i+1])*(d[i+1]-r);
        s.insert(d[i+1]);
        
        
    }
    cout<<ans<<endl;
}
