#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os, const map<T,U>& mp){ os << "{"; for(auto& p : mp){ os << p << ","; } os << "}"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
using ll = long long;
using ull = unsigned long long;
using pii = std::pair<int,int>;
using vi = std::vector<int>;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

// Range Minimum
struct SegmentTree{
    int n;
    vector<int> data;
    int init;

    SegmentTree(int n_, int ini){
        init = ini;
        n = 1;
        while(n < n_) n *= 2;
        data.assign(2*n-1, init);
    }

    void update(int k, int v){
        k += n-1;
        data[k] = v;
        while(k>0){
            k = (k-1)/2;
            data[k] = min(data[2*k+1], data[2*k+2]);
        }
    }

    // search [p,q)
    int query(int a, int b, int k, int l, int r){
        if(a <= l && r <= b){
            //assert(n-1 <= k && k < 2*n-1);
            return data.at(k);
        }
        else if(r <= a || b <= l) return init;
        else{
            int v1 = query(a,b, k*2+1, l, (l+r)/2);
            int v2 = query(a,b, k*2+2, (l+r)/2, r);
            return min(v1,v2);
        }
    }

    int query(int l,int r){
        return query(l,r,0,0,n);
    }
};

int main(){
    int N; cin >> N;
    vector<ll> a(N+2);
    a[0] = 0;
    a[N+1] = 0;
    SegmentTree seg(N+2,INF);
    for(int i=1;i<=N;i++){
        cin >> a[i];
    }
    for(int i=0;i<N+2;i++){
        seg.update(i,a[i]);
    }


    ll ans = 0;
    for(int i=1;i<=N;i++){
        ll L = [&](){
            int l,r;
            l = 0;
            r = i;
            while(r-l>1){
                int m = (l+r)/2;
                int val = seg.query(m, i);

                if(val > a[i]){
                    r  = m;
                }else{
                    l = m;
                }
            }
            return i-l;
        }();

        ll R = [&](){
            int l,r;
            l = i+1;
            r = N+2;
            while(r-l>1){
                int m = (l+r)/2;
                int val = seg.query(i+1, m);
                if(val < a[i]){
                    r = m;
                }else{
                    l = m;
                }
            }
            return l-i;
        }();

        ans += L * R * a[i];
    }
    cout << ans << endl;
}


Measured memory_bytes: 3840