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:
import math

def naive(a, b, n):
    days, answer = 0, 0
    while answer < n:
        print days, answer
        days += 1
        answer += a
        if answer >= n:
            break
        answer -= b
    print days


def formula_based(a, b, n):
    res = 1
    n -= a
    res += (n / (a-b))
    if n % (a-b) :
        res += 1
    return res

a, b, n = map(int, raw_input().strip().split())
#naive(a, b, n)
print formula_based(a, b, n)