#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int n,arr[200005];
LL ans=0,mas=INT_MAX;
int main(){
    scanf("%d",&n);
    for (int i=1;i<=n;++i){scanf("%d",arr+i);mas=min(mas,(LL)arr[i]);}
    ans+=mas*(LL)(n);for (int i=1;i<=n;++i){arr[i]-=mas;}
    for (int i=1;i<=n;++i){arr[n+i]=arr[i];}
    n<<=1;
    int pre=1,len=0;
    for (int i=1;i<=n;++i){
        if (arr[i]){len=max(len,i-pre+1);}
        else{pre=i+1;}
    }
    ans+=len;
    printf("%lld",ans);
    return 0;
}