#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long offset = 1000000000;
const long long N = 1e5;
long long power(long long x, long long y) {
  long long res = 1;
  while (y) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  res = res * x;
  return res;
}
vector<vector<long long> > divi(long long n) {
  vector<vector<long long> > v(n + 1);
  for (long long i = 1; i < n + 1; i++) {
    for (long long j = 1; j * j <= i; j++) {
      if (i % j == 0) {
        if (j * j == i) {
          v[i].push_back(j);
        } else {
          v[i].push_back(j), v[i].push_back(i / j);
        }
      }
    }
  }
  return v;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long tcount;
  tcount = 1;
  while (tcount--) {
    long long n;
    cin >> n;
    vector<long long> a(n);
    for (long long i = 0; i < n; i++) cin >> a[i];
    sort(a.begin(), a.end());
    reverse(a.begin(), a.end());
    long long mx = a[0];
    long long ind = 0;
    for (long long i = 1; i < n - 1; i++) {
      if (a[i] == a[i - 1])
        ind = i;
      else
        break;
    }
    long long cmx = mx;
    long long f = 0;
    for (long long i = 1; i < n; i++) {
      long long dif = mx - a[i];
      if (dif <= cmx)
        cmx -= dif;
      else {
        cmx = 0;
        break;
      }
    }
    long long ans = cmx / (n - 1) + ((cmx % (n - 1)) != 0);
    cout << ans + mx << endl;
  }
  return 0;
}
