Invisible point#3186
Danya marked a point on the plane with sympathetic ink and drew a regular -gon with normal ink. Max can see the -gon but cannot see the point. He can draw a straight line and ask Danya on which side of the line the point is located. What is the minimum number of questions Max needs to ask in order to determine whether the point is inside the -gon?
The input consists of a single integer (3 \leq n \leq 1000000) — the number of vertices of the -gon.
Print a single integer: the answer to the question in the statement.
Example 1