import heapq


def next_to(o1, o2, h, d):
    oa = max(o1, o2)
    oi = o1 + o2 - oa
    if oa == h:
        return 1
    elif oa < h:
        t = oa
    elif oi < h:
        t = oi
    else:
        return 1
    ret = (h - t + d - 1) // d
    return ret


def solve():
    d = int(input())

    h1 = int(input())
    h2 = int(input())
    h3 = int(input())

    q = [(0, (h1, h2, h3))]

    while q:
        n, h = heapq.heappop(q)

        zs = h.count(0)
        if zs >= 2:
            continue

        ma = max(h)
        mi = min(h)
        mu = sum(h) - ma - mi
        mic = h.count(mi)

        if h[0] != h[1] and h[0] != h[2] and h[1] != h[2] and h[1] != mu:
            print(n)
            return

        if d == 0:
            print(-1)
            return

        if h[0] != mi or mic != 1:
            m = next_to(h[1], h[2], h[0], d)
            heapq.heappush(q, (n + m, (max(0, h[0] - d * m), h[1], h[2])))

        if (h[1] != mi or mic != 1) and h[1] != ma:
            m = next_to(h[0], h[2], h[1], d)
            heapq.heappush(q, (n + m, (h[0], max(0, h[1] - d * m), h[2])))

        if h[2] != mi or mic != 1:
            m = next_to(h[0], h[1], h[2], d)
            heapq.heappush(q, (n + m, (h[0], h[1], max(0, h[2] - d * m))))

    print(-1)


if __name__ == '__main__':
    solve()