#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  long double X,Y,H;
  cin>>X>>Y>>H;

  if(X>Y) swap(X,Y);

  int ans=0;
  X*=1000;
  Y*=1000;

  while(X>H){
      X/=2;
      H*=2;
      ans++;
  }
  while(Y>H){
      Y/=2;
      H*=2;
      ans++;
  }

  cout<<ans<<endl;

  return 0;
}