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-----
13 3 1

-----Sample Output-----
3

There is just enough room for three, as shown below:
Figure

Difficulty: introductory

Starter code:

Solutions:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)

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

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


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

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


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

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

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

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

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

x,y,z = map(int,input().split())
ans = 0
i = 1
while 1:
    haba = (i*y)+((i+1)*z)
    if haba>x : break
    else : ans = i
    i+=1
    
print(ans)

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

result = 0
while y*result + z*(result+1) <= x:
  result += 1

print(result-1)

a,b,c = map(int,input().split())
#lis = list(map(int,input().split()))
print((a-c)//(b+c))

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

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


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


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

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

i = 1
while True:
  if (y + z) * i + z > x:
    print((i-1))
    break
  i += 1


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

x,y,z = list(map(int, input().split()))
b = x-z
c = y+z

print(b//c)

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

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

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

x, y, z = [int(i) for i in input().split()]
ans = x // (y + z)
if x - (ans * (y + z)) < z:
    ans -= 1
print(ans)


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


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

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

cnt = 1
x -= y + 2*z

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

x, y, z = map(int, input().split())
sum = y + z + z
if x < sum:
    print(0)
else:
    ans = 1
    while sum <= x:
        sum += y + z
        ans += 1


    print(ans - 1)

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

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

def main():
    X, Y, Z = list(map(int, input().split()))
    rest = X - Z
    c = 0
    while rest > 0:
        rest = rest - Y - Z
        if rest < 0:
            print(c)
            return
        elif rest == 0:
            print((c+1))
            return
        else:
            c += 1
main()


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


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

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

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

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

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

X, Y, Z = list(map(int, input().split()))
if X - Y - 2 * Z < 0:
    print((0))
    return
X = X - Y - 2 * Z
ans = 1
for i in range(10 ** 5):
    if X - Y - Z >= 0:
        X = X - Y - Z
        ans += 1
        continue
    else:
        break
print(ans)


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

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


# coding = SJIS

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

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

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

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

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

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

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

X = X - Z

print(X//(Y + Z))


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

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

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

x,y,z=map(int,input().split())
n=[i for i in range(z,x-z,y+z)]
if n[-1]+y+z<=x:
  print(len(n))
else:
  print(len(n)-1)

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

X,Y,Z = map (int, input ().split ())
X = X-Z
A = (X/(Y+Z))//1
print (round (A))

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

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

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

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

a = list(map(int,input().split()))
# b = list(map(int,input().split()))

x = 0
count=0

while a[0]-a[2]>= x:
    x += a[1]
    x += a[2]
    count+=1

print((count-1))



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

x=list(map(int,input().split()))
print((x[0]-x[2])//(x[1]+x[2]))

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

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

def answer(x: int, y: int, z: int) -> int:
    return len(range(y + z * 2, x + 1, y + z))


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


def __starting_point():
    main()
__starting_point()

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

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

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

n = X // (Y+Z)
m = X % (Y+Z)

if m >= Z:
  print(n)
else:
  print((n - 1))


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

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

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

cnt = 0
length = x - (2*z)

cnt += length//(y+z)
length = length%(y+z)
if y <= length:
    cnt += 1

print(cnt)

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

def main():
    x, y, z = list(map(int, input().split()))
    x -= y + z * 2
    ans = 0
    if x < 0:
        return ans
    while x >= 0:
        ans += 1
        x -= y + z
    print(ans)


def __starting_point():
    main()

__starting_point()

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

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

X -= Z

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


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

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

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

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


import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: list(map(int, sys.stdin.readline().split()))
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

a, b, c = rm()
print(((a-c) // (b+c)))









def mapt(fn, *args):
    return tuple(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


def main():
    x, y, z = Input()

    people = x // y
    spaces = (people + 1) * z
    while True:
        if people * y + spaces <= x:
            print(people)
            return
        people -= 1
        spaces = (people + 1) * z


main()

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

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

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

ans = 0

for i in range(x):
    
    if y*i+z*(i+1) <= x:
        ans=max(ans, i)
print(ans)


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


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

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

x -= z

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


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


import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし


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


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

lst = input().split()
x = int(lst[0])
y = int(lst[1])
z = int(lst[2])

x -= z

print(x // (y + z))

a,b,c = map(int,input().split())
for i in range(a):
    if b * (i + 1) + c * (i + 2) > a:
        print(i)
        return

def main():
    x, y, z = list(map(int, input().split()))
    x -= y + z * 2
    ans = 0
    if x < 0:
        print(ans)
    while x >= 0:
        ans += 1
        x -= y + z
    print(ans)


def __starting_point():
    main()

__starting_point()

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

x, y, z = (int(i) for i in input().split())
ans = 0
while True:
    x -= (y + z)
    if x - z >= 0: ans += 1
    else: break
print(ans)

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

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

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

x,y,z = map(int,input().split())
for ans in range(1,100000):
    if ans*y+(ans+1)*z <= x < (ans+1)*y+(ans+2)*z:
        print(ans)
        return

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

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

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

a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
print((a-c)//(b+c))

X, Y, Z = (int(x) for x in input().split())

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

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

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

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

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

def answer(x: int, y: int, z: int) -> int:
    return (x - z) // (y + z)


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


def __starting_point():
    main()
__starting_point()

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

x,y,z=map(int,input().split())
n=0
while True:
  if n*y+(n+1)*z>x:
    print(n-1)
    return
  n+=1

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