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