最多可能的max(maxa,(sum+n-2) / ( n-1 ) )
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <deque>
#include <map>
#define cler(arr, val) memset(arr, val, sizeof(arr))
typedef long long LL;
const int MAXN = 714100;
const int MAXM = 140000;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
int main()
{
int n;
LL sum=0,maxx=0,a;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a;
sum+=a;
maxx=max(a,maxx);
}
if(sum%(n-1))
sum=sum/(n-1)+1;
else sum=sum/(n-1);
cout<<max(sum,maxx)<<endl;
return 0;
}