#include using namespace std; #define rep(i, n) for(int(i) = 0; (i) < (n); (i)++) #define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++) #define All(v) (v).begin(), (v).end() #define pb push_back #define MP(a, b) make_pair((a), (b)) template vector make_vec(size_t a, T val) { return vector(a, val); } template auto make_vec(size_t a, Ts... ts) { return vector(a, make_vec(ts...)); } using ll = long long; using pii = pair; using pll = pair; using Graph = vector>; template struct edge { int to; T cost; edge(int t, T c) : to(t), cost(c) {} }; template using WGraph = vector>>; const int INF = 1 << 30; const ll LINF = 1LL << 60; const int MOD = 1e9 + 7; int main() { ll x, y, h; cin >> x >> y >> h; x *= 1000, y *= 1000; int res = 0; while(1) { bool f = 0; if(x > y) swap(x, y); if(x > h) { y *= 2, h *= 4; } else if(y > h) { x *= 2, h *= 4; } else { break; } res++; } cout << res << endl; }