Description

Given a number $n$, you can perform several operations. Each operation can flip a bit in the binary representation of $n$ (i.e., change $0$ to $1$ or $1$ to $0$).
Question: What is the minimum number of operations required to change $n$ to $n-1$?

Input Format

A positive integer $n$ ($1 < n \le 10^9$)

Output Format

Output the minimum number of operations.

Sample

10

2