B"Burenka came to kindergarden. This kindergarten is quite strange, so each kid there receives two fractions ( frac{a}{b} and frac{c}{d} ) with integer numerators and denominators. Then children are commanded to play with their fractions. Burenka is a clever kid, so she noticed that when she claps once, she can multiply numerator or denominator of one of her two fractions by any integer of her choice (but she can't multiply denominators by 0 ). Now she wants know the minimal number of claps to make her fractions equal (by value). Please help her and find the required number of claps! The first line contains one integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. Then follow the descriptions of each test case. The only line of each test case contains four integers a , b , c and d ( 0 <= q a, c <= q 10^9 , 1 <= q b, d <= q 10^9 ) -- numerators and denominators of the fractions given to Burenka initially. For each test case print a single integer -- the minimal number of claps Burenka needs to make her fractions equal. In the first case, Burenka can multiply c by 2 , then the fractions will be equal. In the second case, fractions are already equal. In the third case, Burenka can multiply a by 4 , then b by 3 . Then the fractions will be equal ( frac{1 cdot 4}{2 cdot 3} = frac{2}{3} ). "...