#include <bits/stdc++.h>
using namespace std;

#define ll long long 
#define lll __int128
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353
#define pii pair<int, int>
#define ld long double
#define fi first
#define se second
#define all(a) a.begin(), a.end()

#define N 110

int vis[N][N][2], dis[N][N][2];

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    
    int x, y, p, q; cin >> x >> y >> p >> q;
    queue<tuple<int, int, int>> s;
    s.emplace(x, y, 1);
    dis[x][y][1] = 0;

    while (!s.empty()) {
        auto [cx, cy, cd] = s.front(); s.pop();

        for (int sx = 0; sx <= cx; ++ sx) {
            for (int sy = 0; sy <= cy; ++ sy) {
                if (sx + sy > p) continue;
                int nx = cx - sx;
                int ny = cy - sy;
                if (nx&&nx+q<ny) continue;
                if (vis[nx][ny][cd^1]) continue;
                vis[nx][ny][cd^1] = 1;
                dis[nx][ny][cd^1] = dis[cx][cy][cd] + 1;
                s.emplace(nx, ny, cd^1);
            }
        }
    }   

    int res = INF;
    for (int i = 0; i <= y; ++ i) if (vis[0][i][0]) res = min(res, dis[0][i][0]);

    cout << (res == INF ? -1 : res) << '\n';
}   

// 3 3
// 2 2