#include <bits/stdc++.h>
using namespace std;
int chkpower2(int x) { return (x && !(x & x - 1)); }
void solve() {
  long long int n;
  cin >> n;
  long long int a[n], sum = 0;
  for (int i1 = 0; i1 < n; i1++) {
    cin >> a[i1];
    sum += a[i1];
  }
  sort(a, a + n);
  if (sum % (n - 1)) {
    sum = sum / (n - 1) + 1;
  } else {
    sum = sum / (n - 1);
  }
  cout << max(a[n - 1], sum);
  return;
}
int main() {
  int t;
  t = 1;
  while (t--) {
    solve();
    cout << "\n";
  }
  return 0;
}
