1282. Count Bits to Flip A to B

Given two non-negative integers a and b, return the number of bit positions that must be flipped to transform a into b. This equals the number of set bits in a XOR b (their Hamming distance).

Input: A JSON object {"a": <non-negative integer>, "b": <non-negative integer>}.

Output: Return the number of differing bits as an integer.

Examples

Input: {"a":10,"b":20}
Output: 4
Explanation: 10 ^ 20 = 30 (11110) with four set bits -> 4.

Input: {"a":7,"b":7}
Output: 0
Explanation: Identical numbers need no flips -> 0.

Constraints

• 0 <= a, b <= 10^12

Asked by