https://vjudge.net/problem/CodeForces-791A/origin

Bear Limak wants to become the largest of bears, or at least to become larger than his brother Bob.

Right now, Limak and Bob weighaandbrespectively. It's guaranteed that Limak's weight is smaller than or equal to his brother's weight.

Limak eats a lot and his weight is tripled after every year, while Bob's weight is doubled after every year.

After how many full years will Limak become strictly larger (strictly heavier) than Bob?

Input

The only line of the input contains two integersaandb(1 ≤ a ≤ b ≤ 10)— the weight of Limak and the weight of Bob respectively.

Output

Print one integer, denoting the integer number of years after which Limak will become strictly larger than Bob.

Examples

4 7

2

4 9

3

1 1

1

Note

In the first sample, Limak weighs4and Bob weighs7initially. After one year their weights are4·3 = 12and7·2 = 14respectively (one weight is tripled while the other one is doubled). Limak isn't larger than Bob yet. After the second year weights are36and28, so the first weight is greater than the second one. Limak became larger than Bob after two years so you should print2.

In the second sample, Limak's and Bob's weights in next years are:12and18, then36and36, and finally108and72(after three years). The answer is3. Remember that Limak wants to be larger than Bob and he won't be satisfied with equal weights.

In the third sample, Limak becomes larger than Bob after the first year. Their weights will be3and2then.

程式碼：

#include <iostream>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cstring>

using namespace std;

int main()
{
	int a, b;
	cin >> a >> b;
	int i = 0;
	while(a <= b)
	{
		a*=3;
		b*=2;
		i++;
	}
	cout << i <<endl;
	return 0;
}