#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  long long maxm = INT_MIN;
  long long sum = 0;
  for (long long i = 0; i < n; ++i) {
    long long x;
    cin >> x;
    sum += x;
    maxm = max(maxm, x);
  }
  long long ans = sum / (n - 1) + (sum % (n - 1) == 0 ? 0 : 1);
  if (ans >= maxm) {
    cout << ans << '\n';
  } else
    cout << maxm << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  srand(static_cast<unsigned>(time(0)));
  long long t;
  t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
