#include <bits/stdc++.h>
using namespace std;
typedef long long int ll ;
vector <ll> b ;
ll n ;
bool check(ll vl){
vector <ll> gg = b ;
ll i = n ;
while(i>=2){
if(b[i]>=vl){
ll gg = abs(b[i]-vl);
b[i-1]+=gg ;
}
i--;
}
if(b[1]<=vl){
b = gg ;
return true ;
}
b = gg ;
return false ;
}
int main() {
b.clear();
cin>>n ;
b.resize(n+5,0);
ll i = 1 ;
ll vv = 0 ;
while(i<=n){
cin>>b[i];
vv = max(vv,b[i]);
//cout<<b[i]<<"\n";
i++;
}
i = 0 ; ll rr = 1e18 ;
while(i<=vv){
if(check(i)==true){
rr = i ;
break ;
} else {
}
i++;
}
cout<<rr ;
return 0 ;
}
//TC - O(N*max)