#include <iostream>
#include<bits/stdc++.h>
using namespace std;
bool check(vector<int> &arr,int mid){
int n = arr.size()-1;
int i=n;
int left=0;
while(i>1){
if(arr[i]+left>mid){
left = left + arr[i]-mid;
}
else{
left=0;
}
i--;
}
return arr[1]+left<=mid;
}
int main() {
// your code goes here
int n;
cin>>n;
vector<int> arr(n+1,0);
int low = INT_MAX;
int high = INT_MIN;
for(int i=1;i<=n;i++){
cin>>arr[i];
low = min(low,arr[i]);
high = max(high,arr[i]);
}
int ans=0;
while(low<=high){
int mid = (low+high)/2;
if(check(arr,mid)==true){
ans=mid;
high=mid-1;
}
else{
low = mid+1;
}
}
cout<<ans<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxiaXRzL3N0ZGMrKy5oPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCgpib29sIGNoZWNrKHZlY3RvcjxpbnQ+ICZhcnIsaW50IG1pZCl7CglpbnQgbiA9IGFyci5zaXplKCktMTsKICAgIGludCBpPW47CiAgICBpbnQgbGVmdD0wOwogICAgCiAgICB3aGlsZShpPjEpewogICAgCQogICAgCWlmKGFycltpXStsZWZ0Pm1pZCl7CiAgICAJCWxlZnQgPSBsZWZ0ICsgYXJyW2ldLW1pZDsKICAgIAkJCiAgICAJfQogICAgCWVsc2V7CiAgICAJCWxlZnQ9MDsKICAgIAkJCiAgICAJfQogICAgCWktLTsKICAgIAkKICAgIH0KICAgIAogICAgcmV0dXJuIGFyclsxXStsZWZ0PD1taWQ7CiAgICAKfQppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuOwoJY2luPj5uOwoJdmVjdG9yPGludD4gYXJyKG4rMSwwKTsKCQoJaW50IGxvdyA9IElOVF9NQVg7CglpbnQgaGlnaCA9IElOVF9NSU47CgkKCWZvcihpbnQgaT0xO2k8PW47aSsrKXsKCQljaW4+PmFycltpXTsKCQlsb3cgPSBtaW4obG93LGFycltpXSk7CgkJaGlnaCA9IG1heChoaWdoLGFycltpXSk7CgkJCgl9CglpbnQgYW5zPTA7CgkKCXdoaWxlKGxvdzw9aGlnaCl7CgkJaW50IG1pZCA9IChsb3craGlnaCkvMjsKCQkKCQlpZihjaGVjayhhcnIsbWlkKT09dHJ1ZSl7CgkJCWFucz1taWQ7CgkJCWhpZ2g9bWlkLTE7CgkJCQoJCX0KCQllbHNlewoJCQlsb3cgPSBtaWQrMTsKCQkJCgkJfQoJfQoJCgljb3V0PDxhbnM8PGVuZGw7CgkKCQoJCglyZXR1cm4gMDsKfQ==