#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int main()
{
	int x1, y1, p, q;
	cin >> x1 >> y1 >> p >> q;
	int x2 = 0, y2 = 0;
	int xx = 0, yy = 0;
	int t = true;
	int ans = 0;
	if (x1 <= p) {
		cout << 1 << endl;
		return 0;
	}
	if (y1 - p - x1 == q) {
		ans += 2;
		y1 -= p;
		y2 += p;
	}
	else {
		ans += 4;
		y1 -= p;
		y2 += p;
		x1 -= p;
		x2 += p;
	}

	while (1)
	{
		//cout << x1 << " " << y1 << endl;
		xx = 0, yy = 0;
		if (x1 <= p) {
			ans++;
			break;
		}
		if (y1 - p - x1 > q) {
			ans = -1;
			break;
		}

		for (int i = 0; i <= p; i++)
			if (y1 - i - (x1 - (p - i)) <= q) {
				yy = i, xx = p - i;
				y1 -= i, x1 -= (p - i);
				break;
			}
		x2 += xx;
		//cout << x1 << " " << y1 << endl;
		if (x2 + q <= y2 + yy) {
			int t = x2 + q - y2;
			y2 = x2 + q;
			yy = yy - t;
		}
		else {
			y2 += yy;
			yy = 0;
		}
		if (yy > p) {
			//cout << yy << endl;
			ans = -1;
			break;
		}
		y1 += yy;
		ans += 2;
		
	}
	cout << ans << endl;
	return 0;
}