#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = (a); i < (ll)(b); i++)
#define all(x) x.begin(), x.end()

void solve() {
    ll R, P, Q;
    cin >> R >> P >> Q;
    ll A, B, C, D;
    cin >> A >> B >> C >> D;

    ll ok = 0, ng = (A + B + C + D) / 3 + 1;
    while (ng - ok > 1) {
        ll mid = (ok + ng) / 2;
        ll Qcnt = 0;
        Qcnt += max(0LL, mid - A);
        Qcnt += max(0LL, mid - B);
        Qcnt += max(0LL, mid - C);
        ll val = P * mid + Q * Qcnt;
        if (val > R) {
            ng = mid;
        } else {
            ok = mid;
        }
    }

    cout << ok << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--) {
        solve();
    }
}