Given two numbers M and N. Write a program to find the position of rightmost different bit in binary representation of numbers.
The input line contains T, denoting the number of testcases. Each testcase follows. First line of each testcase contains two space separated integers M and N.
For each testcase in new line, print the position of rightmost different bit in binary representation of numbers. If both M and N are same then print -1 in this case.
1 <= T <= 100
1 <= M <= 1000
1 <= N <= 1000
Tescase 1: Binary representaion of the given numbers are: 1011 and 1001, 2nd bit from right is different.