#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  ll h, w, la, lb, ka, kb; cin >> h >> w >> la >> lb >> ka >> kb;
  ll ans = LINF;
  if (ka > 0 || kb > 0) ans = (h * w + max(ka, kb) - 1) / max(ka, kb);
  REP(_, 2) {
    for (int a = 0; ; ++a) {
      if (ka * a >= h * w) {
        chmin(ans, a);
        break;
      }
      ll need = h * w - ka * a;
      const ll coef = min(la * a, h) * lb + kb;
      if (coef > 0 && (need + coef - 1) / coef <= w / lb) {
        chmin(ans, a + (need + coef - 1) / coef);
      } else {
        need -= min(la * a, h) * w;
        const ll pre_b = (w + lb - 1) / lb;
        need -= pre_b * kb;
        if (need <= 0) {
          chmin(ans, a + pre_b);
        } else if (ka > 0 || kb > 0) {
          chmin(ans, a + pre_b + (need + max(ka, kb) - 1) / max(ka, kb));
        }
      }
      if (la * a >= h) break;
    }
    swap(h, w);
    swap(la, lb);
    swap(ka, kb);
  }
  cout << ans << '\n';
  return 0;
}