import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    def iskado(hh):
        if (hh[0]>hh[1]<hh[2] or hh[0]<hh[1]>hh[2]) and hh[0]!=hh[2]:
            return True
        else:return False

    inf=10**12
    d=II()
    a=II()
    b=II()
    c=II()
    hh=[a,b,c]
    if hh.count(0)>1:
        print(-1)
        exit()
    if d==0:
        if iskado(hh):print(0)
        else:print(-1)
        exit()
    # 真ん中を最大にする場合
    cnt1=0
    for i in [0,2]:
        k=max((hh[i]-hh[1]+d)//d,0)
        cnt1+=k
        hh[i]=max(hh[i]-d*k,0)
        if hh[0]==hh[2]:
            hh[0]=max(hh[0]-d,0)
            cnt1+=1
    if not iskado(hh):cnt1=inf
    # 真ん中を最小にする場合
    hh=[a,b,c]
    cnt2=0
    if hh[0]==hh[2]:
        hh[0]=max(hh[0]-d,0)
        cnt2 += 1
    k=max((hh[1]-min(hh[0],hh[2])+d)//d,0)
    cnt2+=k
    hh[1]=max(hh[1]-d*k,0)
    if not iskado(hh):cnt2=inf
    ans=min(cnt1,cnt2)
    if ans==inf:print(-1)
    else:print(ans)

main()