codeforces #334 B. Eight Point Sets

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define N 100001
int a[N];
int main(){
    int i,j,n,m;
    while(scanf("%d",&n)!=EOF){
            long long int sum=0;
        for(i=1;i<=n;i++)
           {cin>>a[i];
             sum+=a[i];
           }
        sort(a+1,a+1+n);
       long long  int res=a[n];
       if(sum<=a[n]*(n-1)){
        cout<<a[n]<<endl;
        continue;
       }
       res=a[n];
       long long int r=sum;
       while(res<r){
        long long int mid=(res+r)/2;
        if(mid*(n-1)>=sum) r=mid;
        else res=mid+1;
       }
       cout<<res<<endl;
    }
    return 0;
}