#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const int MOD = 998244353;
int a[N];
int n;
long long acc;
long long mmax;
long long mmin;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) scanf("%d", a + i);
  mmin = *min_element(a, a + n);
  mmax = *max_element(a, a + n);
  for (int i = 0; i < n; i++) acc += a[i];
  long long l = mmax, r = 1e14;
  long long ans = 0;
  while (l <= r) {
    long long mid = l + r >> 1;
    long long x = (long long)mid * (n - 1);
    if (x >= acc) {
      ans = mid;
      r = mid - 1;
    } else
      l = mid + 1;
  }
  cout << ans << endl;
  return 0;
}
