Given a number, swap the adjacent bits in the binary representation of the number, and print the new number formed after swapping.Input FormatThe first line of input contains T - the number of test cases. Each of the next T lines contains a number N.Output FormatFor each test case, print the new integer formed after swapping adjacent bits, separated by a new line.Constraints1 <= T <= 1000000 <= N <= 109ExampleInput410743100Output51123152ExplanationTest-Case 1Binary Representation of 10: 000...1010After swapping adjacent bits: 000...0101 (5)Test-Case 2Binary Representation of 7: 000...0111After swapping adjacent bits: 000...1011 (11)

You are given two numbers A and B. Write a program to count the number of bits to be flipped to change the number A to the number B. Flipping a bit of a number means changing a bit from 1 to 0 or vice versa.Input FormatThe first line of input contains T - the number of test cases. Each of the next T lines contains 2 integers A and B, separated by space.Output FormatFor each test case, print the number of bit flips required to convert A to B, separated by a new line.Constraints1 <= T <= 1000000 <= N <= 109ExampleInput420 1016 81 153549 24Output4236

Max Score: 50You are given two numbers A and B. Write a program to count the number of bits to be flipped to change the number A to the number B. Flipping a bit of a number means changing a bit from 1 to 0 or vice versa.Input FormatThe first line of input contains T - the number of test cases. Each of the next T lines contains 2 integers A and B, separated by space.Output FormatFor each test case, print the number of bit flips required to convert A to B, separated by a new line.Constraints1 <= T <= 1000000 <= N <= 109ExampleInput420 1016 81 153549 24Output4236

Given an Integer N, write a program to reverse it.InputThe first line contains an integer T, total number of testcases. Then follow T lines, each line contains an integer N.OutputFor each test case, display the reverse of the given number N, in a new line.Constraints1 ≤ T ≤ 10001 ≤ N ≤ 1000000Sample 1:InputOutput41234531203212323005432130213321232

Write a function that takes an integer and returns the number of 1 bits it has.Problem Constraints0 <= A <= 4294967295Input FormatFirst and only argument contains integer AOutput FormatReturn an integer as the answerExample InputInput1: 11Example OutputOutput1:3Example ExplanationExplaination1:11 is represented as 1101 in binary

Look at the following sequence:3, 5, 6, 9, 10, 12, 17, 18, 20....All the numbers in the series have exactly 2 bits set in their binary representation. Your task is simple, you have to find the Nth number of this sequence.Input FormatThe first line of input contains T - the number of test cases. It's followed by T lines, each containing a single number N.Output FormatFor each test case, print the Nth number of the sequence, separated by a newline. Since the number can be very large, print the number % 1000000007.Constraints30 points1 <= T, N <= 20070 points1 <= T, N <= 105100 points1 <= T <= 1051 <= N <= 1014ExampleInput512550100Output3510104016640