#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

template<typename T1,typename T2>ostream& operator<<(ostream& os,const pair<T1,T2>& a) {os << "(" << a.first << ", " << a.second << ")";return os;}

const char newl = '\n';

int main() {
    ll x,y,h;
    int e = 0;
    cin >> x >> y >> h;
    x *= 1000;y *= 1000;
    if (x > y) swap(x,y);
    int ans = 0;
    while (x+e > h) {
        ans++;
        if (x&1) e = 1;
        x /= 2;h *= 2;
    }
    e = 0;
    while (y+e > h) {
        ans++;
        if (y&1) e = 1;
        y /= 2;h *= 2;
    }
    cout << ans << endl;
}