Skip to content
UPEEC

Hamming Distance

Easy#bit-manipulation#xor· solved by 0 · time limit 2.0 s

The Hamming distance of two integers is the number of bit positions where they differ. Print it.

Input

Two integers aa and bb.

Output

The Hamming distance.

Constraints

0≤a,b<2310 \le a, b < 2^{31}

Sample 1

Input

1 4

Output

2

Sample 2

Input

3 1

Output

1

Sign in or join free to run and submit your solution.