#include <algorithm>
#include <cassert>
#include <ios>
#include <iostream>

using namespace std;
using ll = long long;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  ll R, P, Q, A, B, C, D;
  cin >> R >> P >> Q >> A >> B >> C >> D;

  ll ok = 0, ng = min(R / P, (A + B + C + D) / 3) + 1;
  while (ng - ok > 1) {
    ll mid = (ok + ng) / 2;

    assert(mid * P <= R);

    ll need = max(0ll, mid - A) + max(0ll, mid - B) + max(0ll, mid - C);
    if (mid * P + need * Q > R) ng = mid;
    else ok = mid;
  }
  cout << ok << '\n';
}