#include<bits/extc++.h>
#include<atcoder/modint>
using namespace __gnu_pbds;
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using Mint = modint998244353;
using mint = modint;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rep2(i, a, b) for (int i = (int)a; i < (int)(b); ++i)
#define rrep2(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); --i)
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; }
constexpr int dx[] = {-1,0,1,0};
constexpr int dy[] = {0,-1,0,1};
constexpr int MAX_N = 100000;
//ダイクストラ法：makedijkstra
//エラトステネスの篩：makesieve
//テストケースが複数の場合：multest

int main(){
    //cin.tie(nullptr);
    //std::ios_base::sync_with_stdio(false);
    int H, W, LA, LB, KA, KB;
    scanf("%d %d %d %d %d %d", &H, &W, &LA, &LB, &KA, &KB);
    auto ceilup = [](int x, int y){return (x-1)/y+1;};
    int ok = ceilup(H, LA) + ceilup(W, LB), ng = 0;
    ull tot = (ull)H*W;
    while(ok - ng > 1){
        int mid = (ok + ng)/2;
        auto solve = [&](){
            rep(i, mid+1) if((ull)KA*i + (ull)KB*(mid - i) + min((ull)LA*i, (ull)H)*min((ull)LB*(mid - i), (ull)W) >= tot){
                ok = mid;
                return;
            }
            ng = mid;
        };
        solve();
    }
    printf("%d\n", ok);
    return 0;
}