#include <iostream>
#include <set>
using namespace std;
int main(void){
    int n, b[200001];
    set<int> s={0};
    long long c=0;
    cin>>n;
    for(int i=1;i<=n;i++){
        int a;
        cin>>a;
        b[a]=i;
    }
    s.insert(n+1);
    for(int i=1;i<=n;i++){
        auto it=s.lower_bound(b[i]);
        long long p=(*it)-b[i],q;
        //cout<<i<<" "<<b[i]<<" "<<(*it);
        it--;
        //cout<<" "<<(*it)<<endl;
        q=b[i]-(*it);
        c+=p*q*i;
        //cout<<c<<endl;
        s.insert(b[i]);
    }
    cout<<c<<endl;
}