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:
stairs=0
a, b, n = raw_input().split(' ')
a=int(a)
b=int(b)
n=int(n)
d=a-b
days=int((n-a+d)/d)
stairs=a+(days-1)*d
if (stairs<n):
    stairs=stairs+a
    days=days+1
print days