Problem:
 Score : 200 points    Problem Statement We have a long seat of width X centimeters.
There are many people who wants to sit here. A person sitting on the seat will always occupy an interval of length Y centimeters.  We would like to seat as many people as possible, but they are all very shy, and there must be a gap of length at least Z centimeters between two people, and between the end of the seat and a person.  At most how many people can sit on the seat?      Constraints  All input values are integers.  1 \leq X, Y, Z \leq 10^5  Y+2Z \leq X         Input Input is given from Standard Input in the following format:  X  Y  Z       Output Print the answer.        Sample Input 1 13 3 1      Sample Output 1 3  There is just enough room for three, as shown below:    Figure        Sample Input 2 12 3 1      Sample Output 2 2       Sample Input 3 100000 1 1      Sample Output 3 49999       Sample Input 4 64146 123 456      Sample Output 4 110       Sample Input 5 64145 123 456      Sample Output 5 109

Solution (Python):
def examB():
    X, Y, Z = LI()
    X -=Z
    ans = X//(Y+Z)
    print(ans)


import sys,copy,bisect,itertools
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examB()

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
m = y+z
c = 0
if x%m < z:
  c = 1
  
print(x//m - c)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int, input().split())
i=1
while (z+y)*i+z<=x:
    i=i+1
print(i-1)

Solution (Python):
X,Y,Z = map(int,input().split())
for i in range(1,100000):
  if Y*i+Z*(i+1) > X:
    print(i-1)
    break

Solution (Python):

X,Y,Z = map(int, input().split())



print((X-Z)//(Z+Y))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):

x, y, z = [int(s) for s in input().split()]
print((x - z) // (y + z))

Solution (Python):
x, y, z = [int(i) for i in input().split()]
print((x - z) // (y + z))

Solution (Python):
x,y,z = map(int,input().split())
a = x-z
print(a//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())
X -= Z 
ans = 0
 
while True:
  X -= (Y + Z)
  if X < 0:
    break
  else:
    ans += 1
    
print(ans)

Solution (Python):


x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int,input().split())
X -= Z
print(X//(Y+Z))

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

x,y,z = inpl()
x -= (y+z+z)
if x < 0:
    print(0)
else:
    print(x//(y+z) + 1)

Solution (Python):
X,Y,Z = map(int,input().split())
print((X-Z)//(Z+Y))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X,Y,Z=map(int,input().split())
for i in range(50001):
    if Y*i+(i+1)*Z>X:
        print(i-1)
        break

Solution (Python):
import sys








def main():
    x, y, z = (int(i) for i in sys.stdin.read().split())
    n = 0
    while True:
        total = (n + 1) * z + n * y
        if total <= x: n += 1; continue
        else:
            if n == 0: print(0)
            else:print(n-1)
            exit()

if __name__ == "__main__":
    
    main()

Solution (Python):
x,y,z = map(int,input().split())
ans = 1
while z*(ans+1) + y*ans <= x:
  ans = ans +1

print(ans-1)

Solution (Python):
x,y,z = map(int,input().split())
ans = 1
while z*(ans+1) + y*ans <= x:
  ans = ans +1

print(ans-1)

Solution (Python):
X, Y, Z = map(int, input().split())
X -= Y + (Z * 2)
cnt = 1
cnt += X // (Y + Z)
print(cnt)

Solution (Python):
a = list(map(int,input().split()))
X=a[0]
Y=a[1]
Z=a[2]
summary=0
cnt=0
tmp=X-Z

while summary<=tmp:
    summary=summary+Y+Z
    if summary<=tmp:
        cnt=cnt+1

print(cnt)

Solution (Python):
X, Y, Z = map(int, input().split())
p = X // (Y+Z)
if p*(Y+Z)+Z > X:
    p -= 1
print(p)

Solution (Python):
x,y,z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
A = list(map(int, input().split()))
A[0] = A[0] - A[2]
a = A[0]//(A[1]+A[2])
print(a)

Solution (Python):
X,Y,Z = map(int,input().split())
count = 0
X += -Z
while X >= (Y+Z):
    X += -(Y+Z)
    count += 1
print(count)

Solution (Python):
x, y, z = map(int, input().split())
if (x - 2 * z) % (y + z) >= y:
  result = (x - 2 * z) // (y + z) + 1
else:
  result = (x - 2 * z) // (y + z)
print(result)

Solution (Python):
x, y, z = map(int, input().split())
x -= z

print(x//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
ans = 0
x -= z
while x >= y+z:
  x -= (y+z)
  ans += 1
print(ans)

Solution (Python):
X,Y,Z=map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x, y, z = map(int, input().split())

print((x - z)//(y + z))

Solution (Python):

def main():
    X, Y, Z = map(int, input().split())
    ans = (X - Z) // (Y + Z)
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
X, Y, Z = map(int, input().split())

print((X-Z)//(Y+Z))

Solution (Python):
X,Y,Z=map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x, y, z = map(int, input().split())
print(x//(y + z) if x%(y + z) >= z else x//(y + z) - 1)

Solution (Python):
a, b, c = map(int, input().split())

print((a - c)// (b + c))

Solution (Python):
x,y,z=map(int,input().split())
i=0
x=x-z
while x-(y+z)>=0:
  x=x-(y+z)
  i+=1
print(i)

Solution (Python):
x, y, z = map(int, input().split())
x -= z
r = x / (y+z)
print(int(r))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
X,Y,Z = map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x,y,z = list(map(int,input().split()))
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int,input().split())
ans = X//(Y+Z)
if X%(Y+Z) < Z:
    ans -= 1
print(ans)

Solution (Python):
x,y,z=map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
a,b,c=map(int,input().split())
print((a-c)//(b+c))

Solution (Python):
x,y,z=map(int,input().split());print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X,Y,Z = map(int,input().split())
left = X - Z
print(left//(Y+Z))

Solution (Python):
X,Y,Z = [int(x) for x in input().split()]
X = X-Z
ans = 0
cnt= 0
for i in range(10**9):
  if ans+Y+Z<=X:
    cnt+=1
    ans+=Y+Z
  else:
    print(cnt)
    exit()

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
X,Y,Z=map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())

print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):

x,y,z = map(int,input().split())

l = y + 2*z
i = 1
while l + y + z <= x:
    l += y + z
    i += 1
print(i)

Solution (Python):
X,Y,Z = map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())

sums = z
cnt = -1
for i in range(1000001):
  if sums > x:
    break
  sums += y + z
  cnt += 1

print(cnt)

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    x, y, z = list(map(int, input().rstrip('\n').split()))
    x -= z
    print(x // (y + z))


if __name__ == '__main__':
    slove()

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X,Y,Z = map(int, input().split())

X -= 2*Z + Y

print(X // (Y + Z) + 1)

Solution (Python):
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(inputs):
    [X, Y, Z] = string_to_int(inputs[0])

    i = 0
    max_num = 0
    while (Y + Z) * i <= X:
        used = (Y + Z) * i + Z
        if X >= used:
            max_num = i
        i += 1
    return max_num


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Solution (Python):
x, y, z = map(int, input().split())

cnt = 0
cm = z
while (cm < x):
    cm += y
    if (cm+z) > x:
        break
    elif (cm+z)<=x:
        cm += z
        cnt += 1
print(cnt)

Solution (Python):
X,Y,Z = map(int ,input().split())
ans = -1
use = Z
while(use <= X):
	use += Y+Z
	ans += 1
    
print(ans)

Solution (Python):
x,y,z=map(int,input().split())
print(x//(y+z)) if x%(y+z)>=z else print(x//(y+z)-1)

Solution (Python):
x, y, z = map(int, input().split())

if x < y + 2*z:
    print(0)
else:
    print(1 + (x - (y + 2*z)) // (y + z))

Solution (Python):

X, Y, Z = map(int, open(0).read().split())

print((X-Z)//(Y+Z))

Solution (Python):
X,Y,Z = map(int, input().split())
print( (X-Z)//(Y+Z) )

Solution (Python):
import sys
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

x, y, z = na()

print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())

print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
print(int((x-z)/(y+z)))

Solution (Python):
X, Y, Z = map(int,input().split())
ans=0
for i in range(100005):
  if X - i * Y - (i + 1) * Z >= 0:
    ans = i
  else:
    break
print(ans)

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X,Y,Z=map(int,input().split())
p=1
w=Y+Z*2

while w<=X:
    w+=Y+Z
    p+=1

print(p-1)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())
X-=Z
print(X//(Y+Z))

Solution (Python):
X,Y,Z = map(int,input().split())
for i in range(10**5):
    if Y*i+Z*(i+1) > X:
        print(i-1)
        break

Solution (Python):
X, Y, Z = map(int, input().split())
print(int((X-Z)/(Y+Z)))

Solution (Python):
x,y,z = map(int, input().split())
n = (x-z)//(y+z)
print(n)

Solution (Python):
x,y,z=map(int,input().split())
x=x-y-2*z
for i in range(50000):
    x=x-y-z
    if x<0:
        print(i+1)
        break

Solution (Python):
x,y,z = map(int,input().split())
print(int((x-z)/(y+z)))

Solution (Python):
x, y, z = map(int, input().split())

if x - y - 2 * z < 0:
    print(0)

print(1 + (x - y - 2 * z) // (y + z))

Solution (Python):
X, Y, Z = map(int, input().split())
X -= Z
print(X // (Y+Z))

Solution (Python):
X,Y,Z = map(int,input().split())
X -= Z*2
ans = 0
while X>=Y:
  X -= (Y+Z)
  ans += 1
print(ans)

Solution (Python):
X,Y,Z = map(int,input().split())
print((X-Z) // (Y+Z))

Solution (Python):
import math
import sys
input = sys.stdin.readline


def main():
    X, Y, Z = map(int, input().split())

    X -= Z
    print(X//(Y+Z))       


if __name__ == '__main__':
    main()

Solution (Python):
x, y, z = map(int, input().split())

for i in range(x // y, 0, -1):
    if (i * y + (i + 1) * z) <= x:
        print(i)
        exit()
print(0)

Solution (Python):
x, y, z = map(int, input().split())
print(int((x-z)/(y+z)))

Solution (Python):
x,y,z=map(int,input().split())
temp=x-z
count=0
flag=0
while(flag==0):
    if temp-(y+z)>=0:
        temp=temp-(y+z)
        count+=1
    else:
        flag+=1
print(count)

Solution (Python):
x, y, z = map(int, input().split())
ans = (x - z) // (z + y)
print(ans)

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
cnt=0
l=0
while l<=x:
    l=0
    cnt+=1
    l+=(cnt*y)+(cnt+1)*z
else:
    print(cnt-1)

Solution (Python):
X , Y, Z = map(int,input().split())

num = (X-Z)//(Y+Z)

print(num)

Solution (Python):
x, y, z = map(int, input().split())

print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int,input().split());print((x-z)//(y+z))

Solution (Python):



def main():


    x,y,z=map(int,input().split())
    first = y+z*2
    other =  y+z

    print(1+((x-first)//other))




if __name__ == "__main__":
    main()

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
cnt = 0
x -= z
while x > 0:
  if x-y-z >= 0:
    x -= y+z
    cnt += 1
  else:
    break
print(cnt)

Solution (Python):
X, Y, Z = map(int, input().split())

n = 1
while n * Y + (n + 1) * Z <= X:
    n += 1
else:
    pass

print(str(n - 1))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
ans = 1

q = x // (y + z)
r = x % (y + z)

if r < z:
    print(q - 1)
else:
    print(q)

Solution (Python):
x, y, z = map(int, input().split())
ans = 1

for i in range(x // y):
    ans += 1
    if y * ans + z * (ans + 1) > x:
        print(ans - 1)
        exit()

Solution (Python):
X,Y,Z = map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
X, Y, Z = map(int, input().split())
i = 1
while True:
    if (i + 1) * Z + i * Y > X:
        print(i - 1)
        break
    i += 1

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X-Z) // (Y+Z))

Solution (Python):
x,y,z = map(int,input().split())
if(x-(y+z)*(x//(y+z))>=z):
    print(x//(y+z))
else:
    print((x//(y+z))-1)

Solution (Python):
import math
x,y,z = map(int,input().split())
x = x-z
print(math.floor(x/(y+z)))

Solution (Python):
x, y, z = map(int, input().split())

print((x - z) // (y + z))

Solution (Python):
X,Y,Z = map(int,input().split())

print((X-Z)//(Y+Z))

Solution (Python):
X,Y,Z=map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
X, Y, Z = list(map(int, input().split()))
print((X - Z) // (Y + Z))

Solution (Python):
x,y,z=map(int,input().split())
cnt=x//(y+z)
print(cnt if cnt*(y+z)+z<=x else cnt-1)

Solution (Python):
X, Y, Z = map(int, input().split())

print((X - Z) // (Y + Z))

Solution (Python):
x,y,z=map(int,input().split())
n=x//y+1
ans=0
for i in range(1,n+1):
    if i*y+(i+1)*z<=x:
        ans=i
print(ans)

Solution (Python):
import math
X,Y,Z = map(int, input().split())

X1 = X - Z
Y1 = Y + Z

N = X1// Y1

print(N)

Solution (Python):
x, y, z = map(int, input().split())
humans = 1
if x >= (y + 2 * z):
    x -= (z + y + z)
    while x >= (y + z):
        x -= (y + z)
        humans += 1
    print(humans)
else:
    print(0)

Solution (Python):
X,Y,Z = map(int,input().split())
print((X - (Y + 2*Z))//(Y+Z)+1)

Solution (Python):
a, b, c = map(int, input().split())
print((a-b-c*2)//(b+c)+1)

Solution (Python):
X,Y,Z=map(int,input().split());print((X-Z)//(Y+Z))

Solution (Python):
import sys
import math
from fractions import gcd





def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""


 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())


 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

X, Y, Z =  map(int, sys.stdin.readline().split())
print((X - Z) // (Y + Z))

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
x,y,z=map(int,input().split())

cnt=0

for i in range(1,x):
	if x>=y*i+z*(i+1):
		cnt+=1
	
	else:break
	

print(cnt)

Solution (Python):
x,y,z = map(int,input().split())

if z<=x-(x//(y+z)*(y+z))<y+2*z:
    print(x//(y+z))
else:
    print(x//(y+z)-1)

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
x,y,z = map(int,input().split())
print((x-z) // (y+z))

Solution (Python):
X, Y, Z = map(int, input().split())
cnt = 0
X -= Z
cnt += X//(Y+Z)
print(cnt)

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
import fractions as f

X,Y,Z = map(int,input().split())

print((X-Z)//(Y+Z))

Solution (Python):
x,y,z=map(int,input().split())

print((x-z)//(z+y))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
a, b, c = map(int,input().split())

a -= c
n = a//(b+c)

print(n)

Solution (Python):
X, Y, Z = map(int, input().split())
cnt = 0
for i in range(1,X):
    if X >= i*Y + (i+1)*Z:
        cnt += 1
print(cnt)

Solution (Python):

x, y, z = map(int, input().split())
x -= z
ans = x // (y+z)
print(ans)

Solution (Python):

import sys


def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

X, Y, Z = ISI()
n = 0
length = Z
while length <= X:
    n += 1
    length += Y + Z
print(n-1)

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X,Y,Z = map(int,input().split())
N = 0

while True:
    N += 1
    if X < (N+1)*Z + N * Y:
        break

print(N-1)

Solution (Python):
x, y, z = map(int, input().split())

print((x - z) // (y + z))

Solution (Python):
def resolve():
    x, y, z = map(int, input().split())
    print((x - z) // (y + z))


if __name__ == "__main__":
    resolve()

Solution (Python):
x, y, z = map(int,input().split())
print(((x-y-2*z) // (y+z))+1)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
def test():
    x,y,z = map(int,input().split())
    x -= 2*z
    count = 0
    while(x >= y):
        x -= (z+y)
        count += 1
    print(count)


if __name__ == "__main__":
    test()

Solution (Python):
import sys
import  math
from statistics import *
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

x, y, z = na()
if x - (x//(y+z)) * (y+z) >= z:
    print(x//(y+z))
else:
    print(x//(y+z)-1)

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
x, y, z = map(int, input().split())
total = x // (y + z)
if (x - (total * (y + z) + z)) >= 0:
    pass
else:
    total = max(0, total - 1)
print(total)

Solution (Python):
X, Y, Z = map(int, input().split())
human = X // (Y + Z)
if (Y + Z) * human + Z > X:
    print(human - 1)
else:
    print(human)

Solution (Python):
x, y, z = map(int, input().split())

print((x - z) // (y + z))

Solution (Python):
X,Y,Z = map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x, y, z = map(int, input().split())

print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X-Z)//(Y+Z))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X-Z)//(Y+Z))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X - Z) // (Y + Z))

Solution (Python):



x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X,Y,Z = map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x,y,z=map(int,input().split());print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int, input().split())
print((x-z) // (y+z))

Solution (Python):
X, Y, Z = map(int, input().split())

ans = (X - Z) // (Y + Z)

print(ans)

Solution (Python):
x,y,z = map(int, input().split())
print((x-z) // (y+z))

Solution (Python):
x,y,z = map(int,input().split())
x -= z
print(x//(y+z))

Solution (Python):
x,y,z = map(int,input().split())
rest = x % (y + z)
quot = x // (y + z)
if rest >= z:
    print(quot)
else:
    print(quot - 1)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())
r = (X-Z)//(Y+Z)
print(r)

Solution (Python):
X, Y, Z = map(int, input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())

ans=z
cnt=0
while True:
  if ans>x:
    break
  ans+=y+z
  cnt+=1
print(cnt-1)

Solution (Python):

X, Y, Z = map(int, input().split())


res = (X-Z) // (Y+Z)


print(res)

Solution (Python):
x,y,z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
def bench(x,y,z):
    return (x-z) // (y+z)

if __name__ == '__main__':
    x,y,z = map(int, input().split())
    print(bench(x,y,z))

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
x, y, z = map(int, input().split())
x -= z
print(x // (y + z))

Solution (Python):
X,Y,Z=map(int,input().split())
print((X-Z)//(Y+Z))

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
(x, y, z) = (int(tok) for tok in input().split())
at_best = x // (y + z)

if at_best * (y + z) + z > x:
  at_best -= 1
  
print(at_best)

Solution (Python):
x, y, z = map(int, input().split())

cnt = 0
while True:
    if x < (y * (cnt + 1) + z * (cnt + 2)):
        break
    else:
        cnt += 1
print(cnt)

Solution (Python):
X,Y,Z = map(int, input().split())
print((X-Z)//(Y+Z))

Solution (Python):
def main():
    X, Y, Z = map(int, input().split())
    return (X-Z) // (Y+Z)
if __name__ == '__main__':
    print(main())

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int, input().split())
 
a = (x-z)//(y+z)
print(a)

Solution (Python):


X, Y, Z = map(int, input().split())

ans = (X - Z) // (Y + Z)
print(ans)

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
x, y, z = (int(i) for i in input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int,input().split())
x -= z
print(x //(y+z))

Solution (Python):
x,y,z=map(int,input().split())
x-=z
print(x//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
x, y, z = map(int, input().split())
print(int(((x - z) / (y + z)) // 1))

Solution (Python):
X,Y,Z=[int(s) for s in input().split()]

print((X-Z)//(Z+Y))

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
def resolve():
    a,b,c=map(int,input().split())
    n=(a-c)//(b+c)
    print(n)
resolve()

Solution (Python):
x, y, z = map(int, input().split())
print((x-z) // (y+z))

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=input().split()
x,y,z=int(x),int(y),int(z)
x-=z
print(x//(z+y))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X - Z) // (Y + Z))

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int, input().split())

print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())

A = X//(Y+Z)
if X%(Y+Z) < Z:
    A -= 1
print(A)

Solution (Python):
x,y,z=map(int, input().split())

for i in reversed(range(0,10**5+1)):
    if x>=(y*i+(i+1)*z):
        print(i)
        break

Solution (Python):
x, y, z = map(int, input().split())

count = x // (y + z)

if x < (y + z) * count + z:
    count -= 1

print(count)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int,input().split())
print((x-(y+2*z))//(y+z)+1)

Solution (Python):
x, y, z = map(int, input().split())
tmp = x - y - z - z
ans = 1 if tmp >= 0 else 0

while True:
    if tmp < y + z:
        break
    tmp = tmp - y - z
    ans += 1

print(ans)

Solution (Python):
x,y,z=map(int,input().split())
print(int((x-z)/(y+z)))

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split(' '))
x -= z
print(x // (y + z))

Solution (Python):
x, y, z = map(int, input().split())
cnt = 0
for i in range(1, x):
    if (i+1) * z + i * y <= x:
        cnt += 1
    else:
        break
print(cnt)

Solution (Python):
a,b,c = map(int,input().split())

print((a-c)//(b+c))

Solution (Python):
x,y,z = [int(x) for x in input().split()]
print((x-z) // (y+z))

Solution (Python):
x,y,z=map(int,input().split())
ans=x//(y+z)
print(ans if ans*(y+z)+z <= x else ans-1)

Solution (Python):
x,y,z = map(int,input().split(" "))
print( (x-z) // (y+z)  )

Solution (Python):
X, Y, Z = map(int, input().split())





import math
print(math.floor((X - Z) / (Y + Z)))

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int, input().split())
x = x-z
ans = x // (y+z)
print(ans)

Solution (Python):
x,y,z = map(int,input().split())
x=x-z
print(int(x//(y+z)))

Solution (Python):
x,y,z=map(int,input().split())
print(int((x-z)/(y+z)))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
a,b,c=map(int,input().split())
import math
print(math.floor((a-c)/(b+c)))

Solution (Python):
a,b,c = [int(n) for n in input().split()]
print(  int((a-c)/(b+c)) )

Solution (Python):
li = list(map(int, input().split()))
print(int((li[0]-li[2])/(li[1]+li[2])))

Solution (Python):

x, y, z = map(int, input().split())
print((x - z) // (y+z))

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
x,y,z=map(int,input().split());print((x-z)//(y+z))

Solution (Python):



X, Y, Z = map(int, input().split())


ans = 0
for i in range(1, 50000):
    if Y * i + Z * (i + 1) <= X:
        ans += 1
    else:
        break


print(ans)

Solution (Python):
x,y,z = map(int,input().split())
print(int((x-z)//(y+z)))

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())
space = x - y - 2*z
a = space // (y+z)
print(a+1)

Solution (Python):
X, Y, Z = map(int, input().split())

print ((X-Z)//(Y+Z))

Solution (Python):
x,y,z=[int(x) for x in input().split()]
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())

a = X // (Y+Z)
if (Y+Z) * a + Z <= X:
    print(a)
else:
    print(a-1)

Solution (Python):
x,y,z =map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())

print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())
print((X - Z) // (Y + Z))

Solution (Python):
X,Y,Z = map(int,input().split(' '))
print(int((X-Z) // (Y+Z)))

Solution (Python):
x, y, z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):

x, y, z=map(int,input().split())

x -= z
A = x // (y+z)

print(A)

Solution (Python):
x, y, z = map(int, input().split())
print((x - z) // (y + z))

Solution (Python):
x,y,z = map(int, input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int,input().split())
x -= z
y += z
print( x // y )

Solution (Python):
X,Y,Z = map(int,input().split())

print((X-Z)//(Y+Z))

Solution (Python):
x,y,z = map(int,input().split())


print((x-z)//(y+z))

Solution (Python):
x, y, z = map(int, input().split())

ans = 0
l_sum = 0

while l_sum <= (x - z):
    ans += 1
    l_sum += y + z
print(ans - 1)

Solution (Python):
x, y, z = map(int, input().split())
x -= z
print(x // (y + z))

Solution (Python):
X, Y, Z = list(map(int,input().split(' ')))

print((X-Z)//(Y+Z))

Solution (Python):
x,y,z = map(int,input().split())
i = z
ans = 0
while i < x:
  i += y+z
  ans += 1
  if i > x:
    ans -= 1
else:
  print(ans)

Solution (Python):
x, y, z = map(int, input().split())

p = 50000
while True:
    if x >= (p+1)*z + p*y:
        print(p)
        exit()
    else:
        p -= 1

Solution (Python):
X , Y, Z = list(map(int,input().split()))
ans = (X - Z) // (Y + Z)
print(ans)

Solution (Python):
X, Y, Z = map(int, input().split())
ans = (X - Z) // (Y + Z)
print(ans)

Solution (Python):
x, y, z = map(int, input().split(' '))
print((x-z) // (y+z))

Solution (Python):
x,y,z = list(map(int,input().split()))
print((x-z)//(y+z))

Solution (Python):
x,y,z = map(int,input().split())
i = 1
while True:
  if x < y * i + z * (i+1):
    print(i-1)
    break
  i += 1

Solution (Python):
x, y, z = map(int, input().split())
ans = (x-z)//(y+z) 
print(ans)

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):

import math
x, y, z = [int(el) for el in input().split(' ')]
print(math.floor((x-z)/(y+z)))

Solution (Python):
x,y,z=map(int,input().split())
print((x-z)//(y+z))

Solution (Python):
X, Y, Z = map(int, input().split())

tmp_width = X - Z

print(tmp_width // (Y + Z))

Solution (Python):
n = list(map(int, input().split()))
a = n[0]
b = n[1]
c = n[2]

i = 0
l = a

l -= c


while l >= (b + c):
    i += 1
    l -= (b + c)
  
print(i)

Solution (Python):
X, Y, Z = [int(x) for x in input().split()]

print((X - Z)//(Y+Z))

Solution (Python):
x,y,z = map(int,input().split())
x -= 2 * z
count = 0
while x >= y:
    x -= (y+z)
    count += 1
else:
    print(count)

Solution (Python):
x,y,z=map(int,input().split())
x-=z
y+=z
print(x//y)