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:
'''
# Read input from stdin and provide input before running code

name = raw_input('What is your name?\n')
print 'Hi, %s.' % name
'''
#print 'Hello World!'

ip = raw_input()
inps = ip.split()
a = int(inps[0])
b = int(inps[1])
n = int(inps[2])
day = 0
count = 0
z = a - b

day1 = n/z
if n%z:
	day1 = day1 + 1
	
day2 = (n-b)/z
if (n-b)%z:
	day2 = day2 + 1
	
if day1 > day2:
	print day2
else:
	print day1
'''
while count <= n:
	count = count + a
	day = day + 1
	if count < n:
		count = count - b
	else:
		break
print day'''