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 days():
    ABN=map(int,raw_input().split())
    A,B,N=ABN[0],ABN[1],ABN[2]
    if A>=N: return 1
    else:
        return int(math.ceil(1.0*(N-B)/(A-B)))

if __name__ == "__main__":
    print days()