#include<bits/stdc++.h>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n, v[5000002];
long long ans;
int main()
{
    f >> n;
    for(int i = 1; i <= n; ++i)
        f >> v[i];
    deque<int>d;
    for(int i = 1; i <= n; ++i)
    {
        while(!d.empty() && v[d.empty()] > v[i])
            d.pop_back();
        if(!d.empty() && d.front() == i-k)
            d.pop_front();
        d.push_back(i);
        ans += v[d.front()];
    }
    g << ans;
    return 0;
}