#include <bits/stdc++.h>
using namespace std;
const int N = 100009;
long long a[N];
int main() {
  int n, m, t, i, j, k = 1;
  while (~scanf("%d", &n)) {
    long long sum = 0;
    for (i = 0; i < n; ++i) {
      scanf("%I64d", &a[i]);
      sum += a[i];
    }
    long long L = *max_element(a, a + n), R = sum, mid, ans;
    while (L <= R) {
      mid = (L + R) >> 1;
      if (mid * n - sum >= mid) {
        ans = mid;
        R = mid - 1;
      } else {
        L = mid + 1;
      }
    }
    printf("%I64d\n", ans);
  }
  return 0;
}
