#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)1e6;
const int inf = (int)1e9;
const int mod = (int)1e9 + 7;
const long long INF = (long long)1e18;
const double eps = 1e-9;
int an[200005];
int bn[200005];
int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &an[i]);
  sort(an, an + n);
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    sum += an[i];
  }
  int ans = sum / (n - 1);
  if (sum % (n - 1) != 0) ans++;
  if (an[n - 1] > ans) ans = an[n - 1];
  printf("%d\n", ans);
  return 0;
}
