import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum INF = 10L^^18; long D; long[] H; void main() { try { for (; ; ) { D = readLong(); H = new long[3]; foreach (i; 0 .. 3) { H[i] = readLong(); } // min x s.t. a > b - D x long calc(long a, long b) { return (a > b) ? 0 : ((b - a) / D + 1); } long ans = INF; void solve(int i, int j, int k) { if (H[i] > 0) { const x = calc(H[i], H[j]); if (H[j] - D * x > 0) { const y = calc(H[j] - D * x, H[k]); chmin(ans, x + y); } } } solve(1, 0, 2); solve(1, 2, 0); solve(0, 2, 1); solve(2, 0, 1); writeln((ans >= INF) ? -1 : ans); } } catch (EOFException e) { } }