Masha has three sticks of length $a$, $b$ and $c$ centimeters respectively. In one minute Masha can pick one arbitrary stick and increase its length by one centimeter. She is not allowed to break sticks.

What is the minimum number of minutes she needs to spend increasing the stick's length in order to be able to assemble a triangle of positive area. Sticks should be used as triangle's sides (one stick for one side) and their endpoints should be located at triangle's vertices.


-----Input-----

The only line contains tree integers $a$, $b$ and $c$ ($1 \leq a, b, c \leq 100$) — the lengths of sticks Masha possesses.


-----Output-----

Print a single integer — the minimum number of minutes that Masha needs to spend in order to be able to make the triangle of positive area from her sticks.


-----Examples-----
Input
3 4 5

Output
0

Input
2 5 3

Output
1

Input
100 10 10

Output
81



-----Note-----

In the first example, Masha can make a triangle from the sticks without increasing the length of any of them.

In the second example, Masha can't make a triangle of positive area from the sticks she has at the beginning, but she can spend one minute to increase the length $2$ centimeter stick by one and after that form a triangle with sides $3$, $3$ and $5$ centimeters.

In the third example, Masha can take $33$ minutes to increase one of the $10$ centimeters sticks by $33$ centimeters, and after that take $48$ minutes to increase another $10$ centimeters stick by $48$ centimeters. This way she can form a triangle with lengths $43$, $58$ and $100$ centimeters in $81$ minutes. One can show that it is impossible to get a valid triangle faster.

Difficulty: interview

Starter code:

Solutions:
a, b, c = sorted(map(int, input().split()))
print(max(0, c - a - b + 1))

a, b, c = sorted(map(int,input().split()))
print(max(0, c-a-b+1))

def solve():
    a = [int(x) for x in input().split()]
    print(max(0,max(a)-(sum(a)-max(a)) + 1))
solve()
# for _ in range(int(input())):


arr=[int(x) for x in input().split()]
arr.sort()
a=arr[0]
b=arr[1]
c=arr[2]
if(a+b>c):
    print(0)
else:
    print(c-a-b+1)

# from itertools import combinations
# from bisect import bisect_left
# from functools import *
# from collections import namedtuple
I = lambda: list(map(int, input().split()))
a = sorted(I())
print(max(0, a[2] - a[1] - a[0] + 1))

a = sorted([int(i) for i in input().split()])
print(max(0, a[2] - a[0] - a[1] + 1))


USE_STDIO = False

if not USE_STDIO:
    try: import mypc
    except: pass

def main():
    a = sorted(map(int, input().split(' ')))
    x = a[0] + a[1] - a[2]
    if x > 0:
        print(0)
    else:
        print(- x + 1)

def __starting_point():
    main()




__starting_point()

a, b, c = list(map(int, input().split()))
m = max(a, b, c)
print(max(0, m - a - b - c + m + 1))


arr=list(map(int,input().split()))
maxval=max(arr)
if(sum(arr)-maxval>maxval):
    print(0)
else:
    val1=sum(arr)-maxval
    print(maxval+1-val1)

t=[int(x)for x in input().split()]
t.sort()
ans=t[2]-t[1]-t[0]+1
if(ans<0):
    ans=0
print(ans)


def go():
    a, b, c = [int(i) for i in input().split(' ')]
    x = 0
    while True:
        if a + b > c:
            if b + c > a:
                if a + c > b:
                    return x
        if a <= b and a <= c:
            a += 1
        elif b <= a and b <= c:
            b += 1
        elif c <= a and c <= b:
            c += 1
        x += 1

print(go())


a, b, c = list(map(int,input().split()))
a, b, c = min(a,b,c), sum([a,b,c]) - max(a,b,c) - min(a,b,c), max(a,b,c)
print(max(0, c - a - b + 1))

A = list(map(int, input().split()))
A = sorted(A)
print(max(0, A[2] - A[0] - A[1] + 1))

a, b, c = sorted(map(int, input().split()))
print(max(0, c - a - b + 1))


l=list(map(int,input().split()))
l.sort()
if l[0]+l[1]<=l[2]:
	print(l[2]+1-l[1]-l[0])
else:
	print("0")

ra, rb, rc = map(int, input().split())
a = min(ra, rb, rc)
c = max(ra, rb, rc)
b = ra + rb + rc - a - c

if (a + b) > c:
    print(0)
else:
    print(c + 1 - a - b)

s = list(map(int,input().split()))
s.sort()
#print(s)

print(max(0, s[2] - s[1] - s[0] + 1))


aa,bb,cc = list(map(int , input().split(" ")))
s = [aa,bb,cc]
s.sort()
a = s[0]
b = s[1]
c = s[2]

if c<a+b:
    print(0)
else:
    print(str(c-(a+b)+1))


a,b,c=list(map(int,input().split()))
m=max(a,b,c)
s=a+b+c-m
if s>m: print(0)
else: print(m-s+1)



a,b,c=list(map(int,input().split()))
d=[a,b,c]

min1=0
d.sort()    
[a,b,c]=d
while(a+b<=c):
    a+=1
    min1+=1
print(min1)



a = list([int(s) for s in str(input()).strip().split(' ', 2)])
cnt = 0
a = sorted(a)
while a[0] + a[1] <= a[2]:
    a[1] += 1
    cnt += 1
print(cnt)

l=list(map(int,input().split()))
l.sort()
if l[2]>=l[0]+l[1]:
    print(l[2]+1-l[0]-l[1])
else:
    print(0)

n = input().split()
a = int(n[0])
b = int(n[1])
c = int(n[2])
if a >= b + c:
    print(a - b - c + 1)
elif b >= a + c:
    print(b - a - c + 1)
elif c >= a + b:
    print(c - a - b + 1)
else:
    print(0)




a,b,c = [int(s) for s in input().split()]
su = a+b+c
ma = max(a,b,c)
print(max(0, 2*ma-su+1))

a = list(map(int, input().split()))
a.sort()
if (a[1] + a[0] > a[2]):
    print(0)
else:
    print(a[2] - a[1] - a[0] + 1)