#include <bits/stdc++.h>
using namespace std;
long long int x[100005];
int main() {
  int n;
  long long mn, mx, md, re, ans;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%I64d", &x[i]);
  sort(x, x + n);
  mn = x[n - 1];
  mx = x[0] + x[n - 1];
  while (mn <= mx) {
    re = 0;
    md = (mx + mn) / 2;
    for (int i = 0; i < n; i++) re += (md - x[i]);
    if (re >= md) {
      ans = md;
      mx = md - 1;
    } else
      mn = md + 1;
  }
  printf("%I64d", ans);
}
