#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
long long n, i, s[400005], minn, sum;
scanf("%I64d",&n);
for(i=1; i<=n; i++)
{
scanf("%I64d", &s[i]);
s[i+n] = s[i];
}
minn = s[1];
for(i=1; i<=n; i++)
{
if(minn>s[i])
minn = s[i];
}
for(i=1; i<=2*n; i++)
s[i] = s[i] - minn;
if(s[1]!=0)
s[1] = 1;
for(i=2; i<=2*n; i++)
{
if(s[i]!=0)
s[i] = s[i-1] + 1;
}
sort(s+1,s+2*n+1);
sum = minn*n + a[2*n];
printf("%I64d",sum);
}
#include<algorithm>
using namespace std;
int main()
{
long long n, i, s[400005], minn, sum;
scanf("%I64d",&n);
for(i=1; i<=n; i++)
{
scanf("%I64d", &s[i]);
s[i+n] = s[i];
}
minn = s[1];
for(i=1; i<=n; i++)
{
if(minn>s[i])
minn = s[i];
}
for(i=1; i<=2*n; i++)
s[i] = s[i] - minn;
if(s[1]!=0)
s[1] = 1;
for(i=2; i<=2*n; i++)
{
if(s[i]!=0)
s[i] = s[i-1] + 1;
}
sort(s+1,s+2*n+1);
sum = minn*n + a[2*n];
printf("%I64d",sum);
}