#include<iostream>
#include<vector>
using namespace std;
#define int long long 
const int N = 1e5 + 10;
int a[N];
vector<pair<int,int> > ve;
signed main()
{
	int n;
	cin >> n;
	for(int i = 1; i <= n; i ++)
	{
		cin >> a[i];
	}
	int ans = 0;
	ans += a[n] * n;
	for(int i = n - 1; i >= 1; i --)
	{
		if(a[i] > a[n])
		{
			ans += a[n] * n;
			ve.push_back({i,a[i] - a[n]});
		}
		if(a[i] <= a[n])
		{
			ans += a[i] * n;
		}
	}
	while(ve.size())
	{
		int now = ve[0].first;
		int c = ve[0].second;
		ans += c * now;
		ve.erase(ve.begin());
		for(int i = 0; i < ve.size(); i ++)
		{
			if(ve[i].second > c)
			{
				ans += (ve[i].second - c) * now;
				ve[i].second = ve[i].second - c;
				continue;
			}
			if(ve[i].second <= c)
			{
				ans += ve[i].second * now;
				ve.erase(ve.begin() + i);
			}
		}
	}
	cout << ans;
	return 0;
}