#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
const int mod = 1e8;
const ll inf = ll(1e18);
const double PI = acos(-1), eps = 1e-9;
const int mxn = 1e5, mxa = 1e9, mxk = 10;
int n, a[mxn];
bool ok(ll x) {
  ll second = 0;
  for (int i = 0; i < n; ++i) second += x - a[i];
  return second >= x;
}
void solve() {
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> a[i];
  ll lo = *max_element(a, a + n), hi = 1e10;
  while (lo < hi) {
    ll mid = lo + (hi - lo) / 2;
    ok(mid) ? hi = mid : lo = mid + 1;
  }
  cout << lo << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  t = 1;
  while (t--) solve();
}
