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:
l = list(map(int, raw_input().split()))

a = l[0]
b = l[1]
n = l[2]

s = 0
c = 0

c = (n-a) // (a-b)
s = c * (a-b)


while True:
	s = s + a
	c += 1
	if s >= n:
	    break
	s = s - b
		
print(c)