#include <bits/stdc++.h>
using namespace std;
struct abc {
  long long int fri, mon;
};
bool compare(abc x1, abc x2) { return (x1.mon < x2.mon); }
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
long long int min(long long int a, long long int b) {
  if (a < b) return a;
  return b;
}
bool isprime(long long int n) {
  if (n == 1) return false;
  for (long long int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
const long long int N = 2e5 + 3, A = 1e6 + 3;
int32_t main() {
  long long int n;
  cin >> n;
  long long int a[n], ans = 0, sum = 0, max = 0;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] > max) max = a[i];
    sum += a[i];
  }
  long long int count = sum / (n - 1);
  if (sum % (n - 1) != 0) count += 1;
  if (count < max) count = max;
  cout << count;
}
