Problem F
Circular Caramel Cookie

A traditional circular caramel cookie (stroopwafel).

This year, your archrival Rob had the audacity to open up another factory for stroopwafels and they have already announced that their stroopwafels will be even bigger than yours. Although the exact size of the new stroopwafels is a well-kept secret, your industrial spy managed to find out that the grid-like pattern of the stroopwafel consists of at most $s$ whole squares. You know for a fact that the area of each square is $1{\text{cm}}^2$ and that the centre point of the stroopwafel always contains the common corner of the four adjacent squares in the centre (i.e., the squares are aligned to a Cartesian grid), as shown in Figure 1.

Figure 1: Illustration of Sample Input 2, with the blue-enclosed region depicting the $60$ whole squares that the cookie contains.

Needless to say, there is no way that you will let Rob outdo you and you plan on releasing a new edition of bigger stroopwafels. Since the production of bigger stroopwafels is more expensive, you naturally want to make them as small as possible. Thus, you are interested in the minimum radius of a stroopwafel with strictly more than $s$ squares.

Input

The input consists of:

• One line with an integer $s$ ($1\le s\le {10}^9$), the number of whole squares Rob’s stroopwafel has at most.

Output

Output the minimum radius in centimetres of a stroopwafel with strictly more than $s$ whole squares. Your answer should have an absolute or relative error of at most ${10}^{-6}$.

11

2.2360679775

59

5.0000000000