#include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <map>
#include <stack>
#include <bitset>
#include <string>
#include <cstring>
#include <iterator>
#include <random>
#define ll long long
#define ld long double
#define inf (ll)(2*1e18)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define pb push_back
#define endl "\n"
using namespace std;
void solve(){
ll n, i, x, res=0;
cin>>n;
vector<pair<ll, ll>> a;
cin>>x;
a.pb({x, 1});
for(i=1;i<n;++i){
cin>>x;
if(a.back().first >= x){
++a.back().second;
}else{
a.pb({x, 1});
}
}
for(i=0;i<a.size()-1;++i){
if(n*a[i].first >= a[i].second*a[i+1].first){
a[i+1].second += a[i].second;
}else{
res += n*a[i].first;
n -= a[i].second;
}
}
res += a.back().first*a.back().second;
cout<<res<<endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
srand(time(nullptr));
ll t=1;
// cin>>t;
for(;t>0;--t){
solve();
}
return 0;
}
