What is the minimum number of matches necessary to pit on the plane $n$ squares with a side in one match? Matches can not be broken and put on each other. The vertices of the squares should be the points where the ends of the matches meet, and the sides are matches themselves.

Write a program that by the number of squares $n$ to be constructed, finds the minimum number of matches required for this.

Input

One integer $n~(1 ≤ n ≤ 10^9)$.

Output

Print the minimum number of matches required to construct $n$ squares.