#include <bits/stdc++.h>

#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm(a, b) (a)/__gcd((a),(b))*(b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define endl '\n'

using namespace std;

typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;

static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1000000007;
static const int SIZE = 200005;

const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};

vector<int> Div(int n) {
    vector<int> ret;
    for(int i = 1; i * i <= n; ++i) {
        if(n % i == 0) {
            ret.pb(i);

            if(i * i != n) ret.pb(n / i);
        }
    }
    sort(all(ret));
    return ret;
}

typedef long double ldbl;
int mx = 0;
void dfs(int cnt, ldbl x, ldbl y, ldbl h) {
    mx = max(mx, cnt);
    if(x <= h && y <= h) {
        return;

    }
    
    if(x > h) {
        dfs(cnt + 1, x / 2, y, h * 2);

    }
    if(y > h) {
        dfs(cnt + 1, x, y / 2, h * 2);

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

    ldbl x, y, h;
    cin >> x >> y >> h;
    x *= 1000; y *= 1000;
    dfs(0, x, y, h);
    cout << mx << endl;

    return 0;
}