#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long powmod(long long x, long long y) {
  long long t;
  for (t = 1; y; y >>= 1, x = x * x % mod)
    if (y & 1) t = t * x % mod;
  return t;
}
unsigned long long gcd(long long x, long long y) {
  return y ? gcd(y, x % y) : x;
}
long long lcm(long long x, long long y) { return x * (y / gcd(x, y)); }
void smask(int pos, int &i) { i = i ^ (1 << pos); }
void clmask(int pos, int &i) { i = i & ~(1 << pos); }
bool chmask(int pos, int i) { return i & (1 << pos); }
double cordist(pair<double, double> a, pair<double, double> b) {
  return sqrt(((a.first - b.first) * (a.first - b.first)) +
              ((a.second - b.second) * (a.second - b.second)));
}
long long n, m, q, r;
void solve() {
  cin >> n;
  long long sum = 0;
  long long maxs = 0;
  for (int i = 0; i < n; i++) {
    cin >> m;
    maxs = max(maxs, m);
    sum += m;
  }
  sum = ceil((double)sum / (n - 1));
  cout << max(maxs, sum) << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int k = 1;
  while (k--) {
    solve();
  }
  return 0;
}
