Number of Mismatching Bits

Determine the number of bits that differ between the binary representations of two given integers "first" and "second".

Input:

The input starts with an integer ‘T’ representing the number of test cases.
Each of the following ‘T’ lines contains two space-separated integers, "first" and "second".

Output:

For each test case, output a single integer on a new line representing the number of mismatched bits in the binary representation of the two integers.

Example:

Input:

3
11 15
23 56
10 20

Output:

1
4
4

Constraints:

• 1 <= T <= 10⁵
• 0 <= first, second <= 10⁹

Note:

Remember not to print anything; just implement the function to return the number of mismatching bits for the given pairs of numbers.