// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define endl '\n';
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
#define py cout << "YES" << endl;
#define pn cout << "NO" << endl;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define int long long
typedef long long ll;
typedef unsigned long long ull;
const ll inf = 1e18;
const ll mod = 1e9+7;
//#define LOCAL // Comment this line before submitting
#ifdef LOCAL
#include "algo/Standard_Stuff/debug.cpp"
#else
#define debug(...) 42
#endif
void judge(){
srand(time(NULL));
#ifdef LOCAL
freopen("1.txt", "r", stdin);
freopen("2.txt", "w", stdout);
#endif
}
signed main(){
fastio; judge();
int n; cin >> n;
vector<int>a(n);
for(auto &x : a) cin >> x;
vector<int>nxt(n,n);
stack<int>st;
for(int i = n-1;i>=0;i--){
while(!st.empty()){
if(a[st.top()]>a[i]){
nxt[i] = st.top();
break;
}
st.pop();
}
st.push(i);
}
debug(nxt);
int cost = 0;
int start = 0;
while(true){
if(start==n){
break;
}
int end = n;
if(nxt[start]==n){
end = n;
cost += a[start]*(n-start);
break;
}
else{
end = nxt[nxt[start]];
cost += a[nxt[start]] * (n - start);
start = end;
}
}
cout << cost;
}
