Let {x} = 0.a₁a₂a₃... be the binary representation of the fractional part of a rational number z. Suppose that {x} is periodic then, we can write

{x} = 0.a₁a₂...a_r(a_r+1a_r+2...a_r+s)^w

for some integers r and s with r ≥ 0 and s > 0. Also, (a_r+1a_r+2...a_r+s)^wdenotes a nonterminating and repeating binary subsequence of {x}.

The subsequence x₁ = a₁a₂ ... a_ris called the preperiod of {x} and x₂ = a_r+1a_r+2 ... a_r+s is the period of {x}.

Suppose that |x₁| and |x₂| are chosen as small as possible then x₁ is called the least preperiod and x₂ is called the least period of {x}.

For example, x = 1/10 = 0.0001100110011(00110011)^w and 0001100110011 is a preperiod and 00110011 is a period of 1/10.

However, we can write 1/10 also as 1/10 = 0.0(0011)^w and 0 is the least preperiod and 0011 is the least period of 1/10.

The least period of 1/10 starts at the 2nd bit to the right of the binary point and the the length of the least period is 4.

Write a program that finds the position of the first bit of the least period and the length of the least period where the preperiod is also the minimum of a positive rational number less than 1.

Each line is test case. It represents a rational number p/q where p and q are integers, p ≥ 0 and q > 0.

Each line corresponds to a single test case. It represents a pair where the first number is the position of the first bit of the least period and the the second number is the length of the least period of the rational number.