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):
X, Y, Z = map(int, input().split())
print((X-Z)//(Z+Y))

Solution (Python):



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


chair_len = x - 2 * z
max_count = 0


i = 0
while True:
    if i%2==0:
        if chair_len-y<0:
            break
        max_count += 1
        chair_len -= y
    else:
        if chair_len-z<0:
            break
        chair_len -= z

    i += 1

print(max_count)

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

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

x, y, z = map(int, input().split())
for i in range(1, x):
    if y * i + z * (i + 1) > x:
        print(i - 1)
        exit()

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

Solution (Python):
x, y, z = list(map(int, input().split()))
count = 0
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())
X -= Z
print(X//(Y+Z))

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

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

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())
print((X-Z)//(Y+Z))

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

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):


import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range(y)]
nfa = lambda: list(map(float, stdin.readline().split()))
nfan = lambda y: [nfa() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

x, y, z = na()

ans = 0
i = z
while i <= x - z:
    i += y
    if i > x - z:
        break
    i += z
    ans += 1

print(ans)

Solution (Python):
X,Y,Z=map(int,input().split())
a=X//(Y+Z)
if X>=a*(Y+Z)+Z:
    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())
c = x // (y + z)
d = x % (y + z)
if d >= z:
    print(c)
else:
    print(c - 1)

Solution (Python):








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

resolve()

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

Solution (Python):
import sys
import os
import math

MOD = 10**9+7

def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

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

if x%(y+z)<z:
    print(x//(y+z)-1)
else:
    print(x//(y+z))

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]





x,y,z=mii()

a=x-z
b=a//(y+z)
print(b)

Solution (Python):
a , b , c = map(int, input().split())
m = a % (b+c)
ans = a // (b+c)
if m >= c:
    print(ans)
else:
    print(ans-1)

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

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=list(map(int,input().split()))
x-=z
print(x//(y+z))

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

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

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

Solution (Python):


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

n = 0
while (y+z)*n + z <= x:
    n += 1
    
print(n-1)

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

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

if __name__ == '__main__':
    main()

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
print(a//(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())

ans = 0
x -= z
ans += x // (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())
a = (x - z) // (y + z)
print(a)

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

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 - 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):
a, b, c = map(int, input().split())
print((a-c)//(b+c))

Solution (Python):
def main():
    import sys
    
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    
    from itertools import combinations
    
    from math import floor, ceil

    

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

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())
if x%(y+z) >= z:
    print(x//(y+z))
else:
    print((x//(y+z))-1)

Solution (Python):

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    x,y,z=MI()
    x-=z
    print(x//(y+z))
    
    

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(int((x-z)/(y+z)))

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

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

Solution (Python):


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

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

Solution (Python):
X,Y,Z=map(int,input().split())
p=1;t=Y+2*Z
while t<X:
  t=t+Y+Z
  if t>X:
    break
  
  p=p+1
 
print(p)

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

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

if X < Y+2*Z:
  ans = 0
else:
  _ = Z
  ans = 0
  while _ <= (X-Z):
    _ += Y
    _ += Z
    if _ <= X:
      ans += 1

print(ans)

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

Solution (Python):
X, Y, Z = [int(_) for _ in input().split()]
print((X - Z) // (Y + Z))

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

Solution (Python):
def isu(x , y , z):

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

    return ans
def main():
    x , y , z = map(int , input().split())
    print(isu(x , y , z))


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())
x -= z
print(x // (y + z))

Solution (Python):
X, Y, Z = map(int, input().split())
i = 0
width = Z
while True :
    width += Y + Z
    i += 1
    if X < width:
        break
print(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())

length = Z
cnt = 0
while length <= X:
    length += Y + Z
    if length > X:
        break
    cnt += 1

print(cnt)

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 < (2*Z + Y):
    print(0)
else:
    print(int((X-Z)/(Z+Y)))

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

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

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

Solution (Python):
def main():
    chair_width, person_width, space = map(int, input().split())
    print((chair_width - space) // (person_width + space))


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())
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):
x,y,z=map(int,input().split())
w=y+2*z
ans=1
while w<=x-(y+z):
    w+=y+z
    ans+=1
print(ans)

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):
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):
isu, hito, sukima =  map(int, input().split())

ninzuu = 0
while True:
  ans = isu // ((hito + sukima) * ninzuu + sukima)
  if ans == 0:
    break
  ninzuu = ninzuu + 1
print(ninzuu-1)

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

Solution (Python):
X,Y,Z=[int(s) for s in input().split()]
count=0
while(X>=Y+2*Z):
  count+=1
  X-=Y+Z
print(count)

Solution (Python):




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


if __name__ == "__main__":
    main()

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

total = Z
answer = 0
for i in range(10**9 + 1):
    if total+(Y+Z) <= X:
        total += Y+Z
        answer += 1
    else:
        print(answer)
        exit()

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

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

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())
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

print(x//(y+z))

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

Solution (Python):
X,Y,Z = map(int,input().split())
p = X - Z
a = Z+Y
ans = p//a
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):
X, Y, Z = map(int, input().split())

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

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

width = X - 2 * Z
if width < Y:
  print(0)
  exit()
  
num = (width - Y) // ( Y + Z)
print(num + 1)

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
ans = x // (y+z)
print(ans)

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    x,y,z=INTM()
    print((x-z)//(y+z))
if __name__ == '__main__':
    do()

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 = 2*z+y

for i in range(2, 1000002): 
    ans += y+z
    if(ans >= x):
        print(i-1 if ans > x else i)
        break

Solution (Python):
import math
import string

def intinput():
    return int(input())

def listintinput():
    return list(map(int,input().split()))

def splitintinput():
    return map(int,input().split())

X, Y, Z = splitintinput()
print(int((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())
i = 1

while True:

	if x < (i * y) + ((i + 1) * z):
		print(i-1)
		exit()

	i += 1

Solution (Python):
arr = input().split()
arr = list(map(int,arr))
x = arr[0]
y = arr[1]
z = arr[2]

count = 0
for i in range(1,10**10):
    if i * y + (i+1) * z <= x:
        count = i
    else:
        break

print(count)

Solution (Python):
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys




read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

X, Y, Z = map(int, readline().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
print(int(x/(y+z)))

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

print(ans)

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

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(_) for _ 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())
answer = (X-Z) // (Y+Z)

print(answer)

Solution (Python):

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
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())
X -= Y + 2 * Z

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

print(ans)

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

cnt = 0
x = x - z

while( x >= y+z ):
  cnt += 1
  x = x - y -z
  
print(cnt)

Solution (Python):
x,y,z=list(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())

s = z
cnt = 0
while True:
    s += y + z
    if s > x:
        break
    cnt += 1

print(cnt)

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

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

ans=math.floor((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())
num=0
sum=z
for i in range(x) :
    if sum<=x :
        sum+=y
        num+=1
        sum+=z
print(num-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())
long = x-z
f = y+z
ans , b = divmod(long,f)
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):
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())

result = X // (Y + Z) - 1
while X >= (result + 1) * Y + (result + 2) * Z:
    result += 1
print(result)

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

Solution (Python):


import numpy as np

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

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

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

ans = 0
s = 0


def judge(x, y, z):
    width = y + 2 * z
    if width > x:
        return 0

    s = 1  
    rest = x - width

    width = y + z
    while width <= rest:
        s += 1
        width = y + z
        rest -= width
    return s


print(judge(X, Y, Z))

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

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

n = (x - z) / (y + z)
print(int(n))

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

Solution (Python):
import math

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

ans = math.floor((x - z) / (y + z))

print(ans)

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

Solution (Python):
import sys
input = sys.stdin.readline
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):
import sys
input = sys.stdin.readline
X, Y, Z = [int(x) for x in input().split()]
ans = 0
X -= Z
ans += (X // (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())
mylist=[]
for i in range(X):
    if (Y*i)+(Z*(i+1)) <= X:
        mylist.append(1)
    else:
        pass
print(len(mylist)-1)

Solution (Python):
x, y, z = map(int, input().split())
x -= z
print(int(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())
X -= Z
print(X // (Y + Z))

Solution (Python):

 
import math
import itertools
import sys
import copy
 




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

X = X - (Z*2)
cnt = 0
while (X >= Y) :
  X -= Y
  cnt += 1
  X -= Z
  
print (cnt)

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

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

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

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())
p = 1

for i in range(x//y):
    if x-(p+2)*z-p*y<y:
        break
    else:
        p+=1

print(p)

Solution (Python):

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

ans = 0

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



print(ans-1)

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=x//(y+z)
if x%(y+z)>=z:
    print(ans)
else:
    print(ans-1)

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


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

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

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

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

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

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):
x, y, z = map(int, input().split())
q, m = divmod(x, (y+z))
print(q if m >= z else q-1)

Solution (Python):
import sys

L, l, d = map(int, sys.stdin.readline().split())

def main():
    x = (L - d) // (l + d)
    return x

if __name__ == '__main__':
    ans = main()
    print(ans)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X, Y, Z = MAP()

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=1
while True:
    l=y*n+(n+1)*z
    if l>x:
        break
    else:
        n+=1
        ans=n
ans-=1
print(ans)

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

Solution (Python):
import math

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 sys
x,y,z = map(int, sys.stdin.readline().split())

ans = x // (y+z)

if x - ans * (y+z) < z:
    print(ans-1)
else:
    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())
ans = x//(y+z)
if x%(y+z) <z:
    ans-=1
print(ans)

Solution (Python):

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

ans = 0
while True:
    if Y * ans + Z * (ans + 1) <= X:
        ans += 1
    else:
        break
print(ans - 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())

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

for i in range(1,10**6):
    if x < y*i + z*(i+1):
        print(i-1)
        exit()

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

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

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

A = (X-Z) 
B = (Y+Z) 

print(A//B)

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

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

print(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())
x -= z
print(x // (y + z))

Solution (Python):
(x, y, z) = map(int, input().split())
for i in range(1, 1000000):
    if y * i + z * (i + 1) > x:
        print(i - 1)
        break
    else:
        continue

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)/(z+y)))

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

print(num-1)

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

chairs = x // (y + z)

if ((chairs * y)+(chairs * z)+z) > x:
  print(chairs - 1)
else:
  print(chairs)

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
memo = y+2*z

while(memo<=x):
    ans += 1
    memo += y+z

print(ans-1)

Solution (Python):
X, Y, Z=list(map(int, input().split()))
a=[]
for i in range(10**5):
  if X>=i*(Y+Z)+Z:
    a.append(i)
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())
if x % (y + z) >= z:
  print(x // (y + z))
else:
  print(x // (y + z) - 1)

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

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

ans = 0
for i in range(100000):
  if (y * i) + (z * (i+1)) <= x:
    ans = i
  else:
    break
print(ans)

Solution (Python):
x,y,z=map(int,input().split())
l=[]
for i in range(x):
    if (x-((z+y)*i+z))>=0:
        l.append(i)
print(max(l))

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 % (Z + Y) >= Z:
    print(X // (Z + Y))
else:
    print(X // (Z + Y) - 1)

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
d = b + c
print(a // d)

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 - 2*z)//(y+z) + 1
print(ans)

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

ans = 0
for i in range(x):
    if (i+1)*z +i*y <= x:
        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())

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

Solution (Python):
n,a,b = [int(i) for i in input().split()]

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

Solution (Python):

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

x = x - y - 2*z
for _ in range(x//y):
    if x - y - z >= 0:
        x = x-y-z
        n += 1
    else:
        break

print(n)

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

i = 0
px = 0
while px <= X:
    i += 1
    px = i * (Y + Z) + Z

print(i-1)

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

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

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

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

Solution (Python):


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

print(1+(X-Y-2*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())
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):
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 sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")

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

main()

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

Solution (Python):
from sys import stdin
import math
import bisect
import heapq
import numpy as np

x,y,z = [int(x) for x in stdin.readline().rstrip().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 = (int(i) for i in input().split())

ans = 0

while (ans+1) * (Y+Z) <= X-Z:
  ans += 1

print(ans)

Solution (Python):
 

[X, Y, Z] = [int(i) for i in input().split()]

personal_width = Y + Z
chair_width = X - Z

number = chair_width // personal_width
amari = X % personal_width

if amari >= X:
    number += 1

print(number)

Solution (Python):
 

[X, Y, Z] = [int(i) for i in input().split()]

personal_width = Y + Z
chair_width = X - Z

number = chair_width // personal_width
amari = X % personal_width

if amari >= X:
    number += 1

print(number)

Solution (Python):
X,Y,Z = map(int,input().split())
print(int((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())
ans = 0
total = ans * Y + (ans+1) * Z
while(total < X):
    ans += 1
    total = ans * Y + (ans+1) * Z
if(total == X):
    print(ans)
else:
    print(ans - 1)

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

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