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:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

# https://www.hackerearth.com/gsf-hacks/algorithm/climbing-stairs-1/

A, B, N = [int(x) for x in raw_input().split()]
if (N - A) % (A - B) == 0:
    print((N - A) // (A - B) + 1)
else:
    print((N - A) // (A - B) + 2)