#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
long long n, ans, sum, maxx;
long long a[maxn];
bool check(long long round) {
  if (n * round - sum >= round) return 1;
  return 0;
}
int main() {
  scanf("%lld", &n);
  for (int i = 1; i <= n; ++i)
    scanf("%lld", &a[i]), sum += a[i], maxx = max(maxx, a[i]);
  long long l = maxx, r = 100000000000000LL;
  while (l <= r) {
    long long mid = (l + r) / 2;
    if (check(mid))
      ans = mid, r = mid - 1;
    else
      l = mid + 1;
  }
  printf("%lld\n", ans);
}
