#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    double x, y, h;
    cin >> x >> y >> h;
    x *= 1000;
    y *= 1000;
    int ans = 0;
    int f[100][100];
    rep(i,100)rep(j,100)f[i][j] = 0;
    double dp[100][100][4];

    rep(i,100)rep(j,100)rep(k,4)dp[i][j][k] = 0;

    dp[0][0][0] = 1;
    dp[0][0][1] = x;
    dp[0][0][2] = y;
    dp[0][0][3] = h;

    rep(i,100){
        rep(j,100){
            if(f[i][j] == 1)continue;
            if(i > 0 && f[i-1][j] == 1){
                if(dp[i-1][j][1] > dp[i-1][j][3]){
                    f[i][j] = 1;
                    dp[i][j][1] = dp[i-1][j][1] / 2;
                    dp[i][j][2] = dp[i-1][j][2];
                    dp[i][j][3] = dp[i-1][j][3] * 2;
                }
            }
            if(j > 0 && f[i][j-1] == 1){
                if(dp[i][j-1][2] > dp[i][j-1][3]){
                    f[i][j] = 1;
                    dp[i][j][1] = dp[i][j-1][1];
                    dp[i][j][2] = dp[i][j-1][2] / 2;
                    dp[i][j][3] = dp[i][j-1][3] * 2;
                }
            }
        }
    }

    rep(i,100){
        rep(j,100){
            if(f[i][j]){
                ans = max(ans, i+j);
            }
        }
    }

    cout << ans << endl;
    return 0;
}