#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 5;
int n;
long long a[maxn], sum, mx;
bool ok(long long val) {
  bool ret = (sum <= (n - 1) * val);
  return ret;
}
void solve() {
  long long l = mx, r = 2e10;
  long long ans;
  while (l <= r) {
    long long mid = (l + r) / 2;
    if (ok(mid))
      ans = mid, r = mid - 1;
    else
      l = mid + 1;
  }
  cout << ans << endl;
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    sum += a[i];
    mx = max(a[i], mx);
  }
  solve();
  return 0;
}
