#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};
/*}}}*/

template<typename T,T iniv=0>
struct Segtree{
    int n;
    vector<T> dat;
    Segtree(int n_){
        n = 1;
        while(n < n_) n *= 2;
        dat.resize(2*n-1);
        for(int i=0;i<2*n-1;i++) dat[i]=iniv;
    }

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

    T query(int a,int b,int k,int l,int r){
        if(r<=a or b<=l) return iniv;
        else if(a<=l and r<=b) return dat[k];
        else{
            T vl = query(a,b,k*2+1,l,(l+r)/2);
            T vr = query(a,b,k*2+2,(l+r)/2,r);
            return min(vl,vr);
        }
    }

    T query(int a,int b){
        return query(a,b,0,0,n);
    }
};

int main(){
    int N; cin >> N;
    vector<int> a(N+2,0);
    rep(i,N) cin >> a[i+1];

    Segtree<int,INF> seg(N+2);
    for(int i=0;i<N+2;i++) seg.update(i,a[i]);

    vector<int> l(N+2),r(N+2);
    for(int i=1;i<=N;i++){
        int p = 0,q = i;
        while(q-p>1){
            int m = (p+q) / 2;
            if(seg.query(m,i+1)==a[i]){
                q = m;
            }else{
                p = m;
            }
        }
        l[i] = p;

        p = i; q = N+1;
        while(q-p>1){
            int m = (p+q)/2;
            if(seg.query(i,m+1) == a[i]){
                p = m;
            }else{
                q = m;
            }
        }
        r[i] = q;
    }

    ll ans = 0;
    for(int i=1;i<=N;i++){
        ll right = r[i] - i;
        ll left = i - l[i];
        //cerr << i << " " << left << " " << right << " " << left * right << endl;
        ans += a[i] * right * left;
    }
    cout << ans << endl;
}


Measured memory_bytes: 4608