The Collatz Conjecture is an interesting phenomenon. Though its principle is very simple, it stillremains among unresolved problems in mathematics, even after many years of study. However,the years of intensive research brought at least some results, which is a huge advantage of thehuman race against the aliens, because they did not study the conjecture for so many years. Wewant to keep this advantage.Imagine a sequence defined recursively as follows: Start with any positive integer x₀ (so-called"starting value"). Then repeat the following: if x_i is even, then x_i+1 = x_i/2 ("half ...") if x_i is odd, then x_i+1 = 3x_i + 1 ("... or triple plus one") The Collatz Conjecture says that every such sequence will eventually reach 1. It has still notbeen proven until today but we already know for sure that this is true for every x₀ < 2⁵⁸. (Nevertell this to aliens!)In this problem, you are given two starting values and your task is to say after how many stepstheir sequences "meet" for the first time (which means the first number that occurs in bothsequences) and at which number is it going to happen. For simplicity, we will assume that thesequence does not continue once it has reached the number one. In reality, it would then turninto 1, 4, 2, 1, 4, 2, 1, . . . , which quickly becomes boring

The input contains several test cases. Each test case is described by a single line containing twointeger numbers A and B, 1 ≤ A, B ≤ 1 000 000.The last test case is followed by a line containing two zeros.

For each test case, output the sentence "A needs S_A steps, B needs S_B steps, they meetat C ", where S_A and S_B are the number of steps needed in both sequences to reach the samenumber C . Follow the output format precisely.