1342. Minimum Flips to Make a OR b Equal to c

Given three non-negative integers a, b and c, return the minimum number of bit flips in a and b (each flip changes one bit of one number) required to make (a OR b) equal to c.

Input: A JSON object {"a": <integer>, "b": <integer>, "c": <integer>}.

Output: Return the minimum number of flips.

Examples

Input: {"a":2,"b":6,"c":5}
Output: 3
Explanation: Bitwise analysis gives 3 flips.

Input: {"a":4,"b":2,"c":7}
Output: 1
Explanation: Only bit 0 is missing -> 1 flip.

Constraints

• 0 <= a, b, c < 2^31

Asked by