#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int INF = INT_MAX;
const int MAX_N = 1e5 + 10;
template <typename T>
inline T sqr(T a) {
  return a * a;
};
int N;
long long sum = 0, ans = 0, lmax = 0, A[MAX_N];
int main(int argc, char const *argv[]) {
  cin >> N;
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
    sum += A[i];
    lmax = max(A[i], lmax);
  }
  ans = sum / (N - 1) + (sum % (N - 1) ? 1 : 0);
  cout << max(ans, lmax) << endl;
  return 0;
}
