#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e5 + 10;
long long n, a[MAXN], sm;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> a[i], sm += a[i];
  sort(a, a + n);
  long long b = 0, e = 2e9, ret = 2e9;
  while (b <= e) {
    long long mid = (b + e) / 2;
    if (mid >= a[n - 1] && sm <= mid * (n - 1))
      ret = mid, e = mid - 1;
    else
      b = mid + 1;
  }
  cout << ret << "\n";
  return 0;
}
