import math
def counter_n(atumi,haba):
	countest=0
	while haba > atumi:
		atumi=atumi*2
		haba=haba/2
		countest=countest+1

	return countest


x,y,h = map(int,input().split(" "))
x= x*1000
y=y*1000
counter = 0

if x ==y:
	counter=counter_n(h,x)
	h= int(h*math.pow(2,counter))
	counter=counter+counter_n(h,y)
elif x > y:
	counter=counter_n(h,y)
	h= int(h*math.pow(2,counter))
	if h <x:
		counter=counter+counter_n(h,x)
elif x < y:
	counter=counter_n(h,x)
	h= int(h*math.pow(2,counter))
	if h <y:
		counter=counter+counter_n(h,y)


print(counter)