#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    ll r,p,q;cin>>r>>p>>q;
    vector<ll>a(4);
    for(auto&o:a)cin>>o;
    ll ok=0,ng=reduce(a.begin(),a.end())+1;
    while(abs(ok-ng)>1)
    {
        ll mid=(ok+ng)/2;
        ll cnt=0,tmp=0;
        for(int i=0;i<3;i++)
        {
            cnt+=max(0ll,a[i]-mid);
        }
        cnt+=a[3];
        for(int i=0;i<3;i++)
        {
            cnt-=max(0ll,mid-a[i]);
            tmp+=q*max(0ll,mid-a[i]);
        }
        if(cnt<0)
        {
            ng=mid;
            continue;
        }
        tmp+=p*mid;
        if(r-tmp<0)ng=mid;
        else ok=mid;
    }
    cout<<ok<<endl;
}