#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)

int main() {
    ll r, p, q, a, b, c, d;
    cin >> r >> p >> q >> a >> b >> c >> d;

    ll past = 0, future = 1000000001;
    while (abs(past - future) > 1) {
        ll hazama = (past + future)/2;
        if (max(0LL, hazama - a) + max(0LL, hazama - b) + max(0LL, hazama - c) <= d && p*hazama + q*(max(0LL, hazama - a) + max(0LL, hazama - b) + max(0LL, hazama - c)) <= r) past = hazama;
        else future = hazama;
    }
    
    cout << past << endl;
    return 0;
}