X,Y,H = map(int,input().split())
X *= 1000
Y *= 1000
from collections import deque

q = deque([(0,X,Y)])
ans = 0
ss = [set()]
while q:
    k,x,y = q.popleft()
    ans = max(ans, k)
    h = 2**k * H
    if x > h:
        if len(ss) <= k+1:
            ss.append(set())
        if (x/2,y) not in ss[k+1]:
            q.append((k+1,x/2,y))
            ss.append((x/2,y))
    if y > h:
        if len(ss) <= k+1:
            ss.append(set())
        if (x,y/2) not in ss[k+1]:
            q.append((k+1,x,y/2))
            ss.append((x,y/2))

print(ans)