#include <iostream>
#include <cmath>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
#define FOR(i,a,b) for(int i=a; i<b; i++)
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define LL long long
#define PP pair<int,int>
int n,k;
vector<PP> v;
vector<int> a;
LL F(int i,int j,int k)
{
//i < j < k
return a[i] + a[j]*2 + a[k] * 3;
}
int main()
{
cin>>n;
a.resize(n);
FOR(i,0,n)
{
cin>>a[i];
v.push_back(make_pair(a[i],i));
}
sort(v.begin(),v.end());
//Tim den nhom dau tien
int index = v[n-1].second;
int count = 3;
LL t = v[n-1].first * 3;
for(int i=n-1; i>=0; i--)
{
if(v[i].second < index)
{
count--;
if(count > 0)
{
index = v[i].second;
//cout<<index<<" - "<<v[i].first<<endl;
t += count*v[i].first;
}
}
}
cout<<t<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y21hdGg+CiNpbmNsdWRlIDx2ZWN0b3I+CiNpbmNsdWRlIDx1dGlsaXR5PgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCiNkZWZpbmUgRk9SKGksYSxiKSBmb3IoaW50IGk9YTsgaTxiOyBpKyspCiNkZWZpbmUgUkVQKGksYSxiKSBmb3IoaW50IGk9YTsgaTw9YjsgaSsrKQojZGVmaW5lIExMIGxvbmcgbG9uZwojZGVmaW5lIFBQIHBhaXI8aW50LGludD4KCmludCBuLGs7CnZlY3RvcjxQUD4gdjsKdmVjdG9yPGludD4gYTsKCkxMIEYoaW50IGksaW50IGosaW50IGspCnsKCS8vaSA8IGogPCBrCglyZXR1cm4gYVtpXSArIGFbal0qMiArIGFba10gKiAzOwp9CgppbnQgbWFpbigpCnsKCgkKCQoJY2luPj5uOwoJYS5yZXNpemUobik7CgkKCUZPUihpLDAsbikKCXsKCQljaW4+PmFbaV07CgkJdi5wdXNoX2JhY2sobWFrZV9wYWlyKGFbaV0saSkpOwoJfQoJCglzb3J0KHYuYmVnaW4oKSx2LmVuZCgpKTsKCQoJLy9UaW0gZGVuIG5ob20gZGF1IHRpZW4KCWludCBpbmRleCA9IHZbbi0xXS5zZWNvbmQ7CglpbnQgY291bnQgPSAzOwoJTEwgdCA9IHZbbi0xXS5maXJzdCAqIDM7Cglmb3IoaW50IGk9bi0xOyBpPj0wOyBpLS0pCgl7CgkJaWYodltpXS5zZWNvbmQgPCBpbmRleCkKCQl7CgkJCWNvdW50LS07CgkJCWlmKGNvdW50ID4gMCkKCQkJewoJCQkJaW5kZXggPSB2W2ldLnNlY29uZDsKCQkJCS8vY291dDw8aW5kZXg8PCIgLSAiPDx2W2ldLmZpcnN0PDxlbmRsOwoJCQkJdCArPSBjb3VudCp2W2ldLmZpcnN0OwoJCQl9CQkKCQl9Cgl9CgkKCWNvdXQ8PHQ8PGVuZGw7CgkKCXJldHVybiAwOwp9