from heapq import heappush,heappop

def check(d,t):
    a,b,s=t
    if d<T.get((a,b,s),inf):
        T[(a,b,s)]=d
        heappush(Q,(d,(a,b,s)))

A,B,S=map(int,input().split())

inf=10**9
T={(A,B,S):0}
Q=[(0,(A,B,S))]

while True:
    d,(a,b,s)=heappop(Q)
    if s==0:
        break

    if s==1:
        check(d+abs(a-1)+abs(1-0),(0,b,0))

    if a==s:
        for k in range(101):
            check(d+abs(a-k),(k,b,k))
    elif b==s:
        for k in range(1,101):
            check(d+abs(b-k),(a,k,k))
    else:
        if abs(a-s)<=abs(b-s):
            check(d+abs(a-s),(s,b,s))
        else:
            check(d+abs(b-s),(a,s,s))

print(d)