#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
long long a[maxn];
int n;
bool ok(long long x) {
  long long res = 0;
  for (int i = 0; i < n; ++i) res += x - a[i];
  return res >= x;
}
long long solve() {
  long long left = *max_element(a, a + n);
  long long right = 2e9;
  while (left <= right) {
    long long mid = (left + right) >> 1;
    if (ok(mid))
      right = mid - 1;
    else
      left = mid + 1;
  }
  return right + 1;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> a[i];
  std::cout << solve() << '\n';
  return 0;
}
