#include <bits/stdc++.h>
#define rep(i, p, n) for (ll i = p; i < (ll)(n); i++)
#define rep2(i, p, n) for (ll i = p; i >= (ll)(n); i--)
using namespace std;
using ll = long long;
using ld = long double;
const double pi = 3.141592653589793;
const long long inf = 2 * 1e9;
const long long linf = 4 * 1e18;
const ll mod1 = 1000000007;
const ll mod2 = 998244353;
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}

// atcoder
#include <atcoder/all>
using namespace atcoder;
using mint1 = modint1000000007;
using mint2 = modint998244353;

vector<pair<ll, ll>> base = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

int main()
{

    //////////////////
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    //////////////////

    ll H, W, La, Lb, Ka, Kb;
    cin >> H >> W >> La >> Lb >> Ka >> Kb;
    ll ans = linf;
    rep(i, 0, 1000001)
    {
        if (i==0) {
        	if (Kb>0) {
	            ans = (H * W - 1) / Kb + 1;
        	}
            continue;
        }
        //cout << ans << endl;
        ll P = 1e12 / min(La*i, H) / Lb;
        ll ok = 1e12 + 1, ng = -1;
        while(ok-ng>1) {
            ll mid = ok + ng;
            mid /= 2;
            if (mid>P) {
                ok = mid;
                continue;
            }
            if (min(H, i*La)*min(W, Lb*mid)+i*Ka+mid*Kb>=H*W) {
                ok = mid;
            }
            else {
                ng = mid;
            }
        }
        chmin(ans, i + ok);
        if (i+ok==2001) {
        	cout << i << " " << ok << endl;
        }
    }
    cout << ans;
}