#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
  int x, p, q;
  cin >> x >> p >> q;
  int a[4];
  for (int i = 0; i < 4; ++i) cin >> a[i];
  int l = 0, r = 1e9 + 5;
  {
    long long sum = 0;
    for (int i = 0; i < 4; ++i) sum += a[i];
    r = min(sum / 3 + 1, x + 1LL);
  }
  while (r - l > 1)
  {
    int mid = (l + r) / 2;
    long long d = 0;
    for (int i = 0; i < 3; ++i)
    {
      d += max(mid - a[i], 0);
    }
    long long c = mid * (long long)p + d * q;
    (c <= x ? l : r) = mid;
  }
  cout << l << endl;
}