#include <bits/stdc++.h>

using i64 = long long;

const int INF = 1E9;

struct Node {
    int cnt, sp, wv;
    bool operator < (const Node &u) const {
        return cnt > u.cnt;
    }
};

void solve() {
    int x, y, p, q;
    std::cin >> x >> y >> p >> q;
    std::priority_queue<Node> pq;
    std::vector vis(2, std::vector(400, std::vector<int>(400)));
    int ans = INF;
    pq.push({0, 0, 0});
    while (!pq.empty()) {
        auto [c, a, b] = pq.top();
        pq.pop();
        vis[c % 2][a][b] = 1;
        if (a == x) {
            ans = std::min(ans, c);
            continue;
        }
        if (c % 2 == 0) {
            for (int t = 1; t <= p && t <= x + y - b - a; ++t) {
                for (int i = 0; i <= x - a && i <= t; ++i) {
                    for (int j = 0; j <= y - b && j <= t - i; ++j) {
                        if (y - b - j > x - a - i + q && a + i != x) continue;
                        if (vis[(c + 1) % 2][a + i][b + j]) continue;
                        pq.push({c + 1, a + i, b + j});
                    }
                }
            }
        } else {
            for (int t = 1; t <= p && t <= a + b; ++t) {
                for (int i = 0; i <= a && i <= t; ++i) {
                    for (int j = 0; j <= b && j <= t - i; ++j) {
                        if (b - j > a - i + q && a - i != 0) continue;
                        if (vis[(c + 1) % 2][a - i][b - j]) continue;
                        pq.push({c + 1, a - i, b - j});
                    }
                }
            }
        }
    }
    if (ans == INF) ans = -1;
    std::cout << ans << "\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    // std::cin >> T;
    while(T--) {
        solve();
    }
}