//WA
#include <iostream>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
//#define endl "\n";
int main(){
    ll R, P, Q;
    ll num[4];
    cin >> R >> P >> Q;
    cin >> num[0] >> num[1] >> num[2] >> num[3];

    ll l = 0, r = 1e9;
    while(l < r){
        ll m = (l + r + 1) / 2;
        ll cost = P * m;
        ll rest = num[3];
        for(int i = 0; i < 3; i++){
            rest += max(0LL, num[i] - m);
        }
        for(int i = 0; i < 3; i++){
            if(num[i] < m){
                if(rest < m - num[i]){
                    //どうしようもない
                    cost = 1e18;
                    break;
                }else{
                    rest -= m - num[i];
                }
                cost += abs(m - num[i]) * Q;
            }
        }
        if(R < cost) r = m - 1;
        else l = m;
    }
    cout << l << endl;
    return 0;
}