#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
const int N = 1e6 + 7;
int main() {
  long long n;
  cin >> n;
  long long a[n];
  long long sum = 0;
  for (long long i = 0; i < (int)n; i++) {
    scanf("%lld", &a[i]);
    sum += a[i];
  }
  sort(a, a + n);
  double e = (double)sum / (n - 1);
  long long ans = ceil(e);
  if (ans < a[n - 1])
    cout << a[n - 1];
  else
    cout << ans;
  return 0;
}
