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:
#########################################################################
#   https://www.hackerearth.com/problem/algorithm/climbing-stairs-1/    #
#########################################################################

def count_days(day, night, stairs):
    stairs -= night
    diff = day - night
    days = stairs // diff
    if days * diff < stairs:
        return days + 1
    else:
        return days

data = raw_input().split()
by_day = int(data[0])
by_night = int(data[1])
stairs = int(data[2])
print count_days(by_day, by_night, stairs)