Problem Statement

Minimum Bit Flips for OR Equality Given three positive integers `a`, `b`, and `c`, find the minimum number of individual bit flips required in `a` and `b` so that `(a OR b) == c`. One flip changes one bit of either `a` or `b`. Input Format One line contains `a b c`. Output Format Print the minimum number of flips. Constraints `1 <= a, b, c <= 10^9`. Example Input: ``` 2 6 5 ``` Output: ``` 3 ```