Associated Course(s):
Sudo Placement [IITs]

Given two numbers **M** and **N**. Write a program to find the position of **rightmost different** bit in binary representation of numbers.

**Input:**

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.

**Output:**

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.

**Constraints:**

1 <= T <= 100

1 <= M <= 1000

1 <= N <= 1000

**Example:**

**Input:**

2

11 9

52 4

**Output:**

2

5

**Explanation:
Tescase 1: **Binary representaion of the given numbers are: 1011 and 1001, 2nd bit from right is different.

Author: harsh.agarwal0

blackshadows | 210 |

xmyqsh | 198 |

hanuman001 | 164 |

Adarsh Trivedi | 148 |

layman_brother | 144 |

blackshadows | 692 |

xmyqsh | 539 |

aman19 | 398 |

r0c2048 | 360 |

kspk | 331 |

akhayrutdinov | 5005 |

Ibrahim Nash | 4871 |

Quandray | 4338 |

sanjay05 | 3668 |

blackshadows | 3196 |

Login to report an issue on this page.