#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<long long>;
using vvll = vector<vector<long long>>;
using vs = vector<string>;
#define lln \
  ll n;     \
  cin >> n;
#define REP(i, n) for (long long i = 0; i < n; i++)
#define REP2(i, s, e) for (long long i = s; i < e; i++)
#define UNIQUE_VECTOR(v) v.erase(unique(v.begin(), v.end()))
ll gcd(ll x, ll y) { return (x % y) ? gcd(y, x % y) : y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }

int main() {
  lln;
  ll k, mi = LLONG_MAX, ma = 0;
  cin >> k;
  vll a(n);
  REP(i, n) {
    cin >> a[i];
    mi = min(mi, a[i]);
  }
  ll l = 0, r = k + a[0] + 1;
  while (1) {
    ll _ = (l + r) / 2;
    ll s = 0;
    ll _k, _ks = 0;
    REP(i, n) {
      if (a[i] + s < _) {
        _k = ((_ - (a[i] + s)) + (i + 1) - 1) / (i + 1);
        s += _k * (i + 1);
        _ks += _k;
      }
    }

    if (_ks <= k) {
      l = _;
      ma = max(ma, _);
    } else {
      r = _;
    }
    if (r - l <= 1) {
      break;
    }
  }
  cout << ma << endl;
}