Problem: Hansa loves dancing and so do her friends. But she has some pretty weird friends. Like this one friend of hers, Jack, jumps forward while dancing. The dance floor is of finite length (L) and there are many people dancing on it. During each song, Jack jumps exactly X steps forward and at the end of the song, he is pushed back Y steps by the other dancers. 

Every class has a nerd. This one does too. The nerd doesn’t like dancing but in order to kill time he is watching this jumping Jack. He is counting the number of songs that have been played before Jack reaches the end of the dance floor. Tell us how many songs he counted.

Note: Even if a song doesn’t complete when he reaches the end of the dance floor, but it has started, then it is counted.

Input:
Three space separated integers L, X, Y.

Output:
A single line of output that is the answer to the question.

Constraints:
1 ≤ Y < X ≤ L ≤ 10^9

Problem Setter: Chintan Shah

SAMPLE INPUT
6 5 1

SAMPLE OUTPUT
2

Solution (in PYTHON):

Solution:
# Problem From -
""" http://www.hackerearth.com/problem/algorithm/weird-friends/"""

inp = raw_input().split()
l = int(inp[0])
x = int(inp[1])
y = int(inp[2])
count = 0
buffer = 0
while True :
    buffer += x
    if buffer >= l :
        count += 1
        break
    else :
        buffer -= y
        count += 1
print count