Problem: Alice is climbing stairs. There are total N stairs. She climbs A stairs upwards in day and she comes downstairs in night by B stairs. Find number of days she will take to reach the top of staircase.   

Input: 
First and only line contains three space separated integers denoting A, B, N.

Output: 
Print only one line of output denoting the answer to the question.

Constraints: 
1 ≤ B<A≤N ≤ 10^9

SAMPLE INPUT
5 1 6

SAMPLE OUTPUT
2

Solution (in PYTHON):

Solution:
first_line = raw_input()
first_line = first_line.split(' ')
A = int(first_line[0])
B = int(first_line[1])
N = int(first_line[2])
# print A,B,N
#
M = N-B

diff = (A-B)
div1 = N/diff
if N%diff>0:
    div1+=1

div2 = M/diff
if M%diff >0:
    div2+=1

print min(div1,div2)