#include <bits/stdc++.h>
using namespace std;
long long ans, i, n, k, g, b, p, us[400000], m = 1000000010, p1, m1, v,
                                             a[400000];
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    p = max(p, a[i]);
    ans += a[i];
  }
  k = ans / (n - 1);
  if (ans % (n - 1) != 0) k++;
  cout << max(k, p);
  return 0;
}
