#include <bits/stdc++.h>
using namespace std;
long long a[100001];
long long n;
bool check(long long rounds) {
  long long ved = 0;
  for (int i = 0; i < n; i++) ved += (rounds - a[i]);
  return rounds <= ved;
}
long long binary(long long l, long long r) {
  if ((l + 1) == r) {
    return r;
  } else {
    long long m = (l + r) / 2;
    if (check(m))
      return binary(l, m);
    else
      return binary(m, r);
  }
}
int main() {
  cin >> n >> a[0];
  long long maxval = a[0], sum = a[0];
  for (int i = 1; i < n; i++) {
    cin >> a[i];
    maxval = max(a[i], maxval);
    sum += a[i];
  }
  cout << binary(maxval - 1, sum);
  return 0;
}
