Invisible point

Daniel marked a point on a plane with sympathetic ink and he has also drawn a regular n-gon with normal ink. Max can see the n-gon, but can't see the point. Max can draw a line and ask Daniel which side of the line the point is. What is the minimum number of questions Max have to ask to define if the point is inside the n-gon in the worst case?

Input

Each test consists of the single integer n (3 ≤ n ≤ 1000000) — the amount of sides of the n-gon.

Output

Print a single number - the anwer to the questiong in the statement.

Examples