Problem: In Manhattan, roads run where the x or y coordinate is an integer. Both Sunuke-kun's house and Sumeke-kun's house are on the road, and the straight line distance (Euclidean distance) is just d. Find the maximum value that can be considered as the shortest distance when traveling along the road from Sunuke-kun's house to Sumek-kun's house.

Constraints

* 0 <d ≤ 10
* d is given up to exactly three decimal places

Input


d


Output

Print the answer on one line. If the absolute error or relative error is 10-9 or less, the answer is judged to be correct.

Examples

Input

1.000


Output

2.000000000000


Input

2.345


Output

3.316330803765

Solution (in CPP):

Solution:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>

using namespace std;

void solve()
{
	double d;
	cin >> d;
	double ans = d * sqrt(2.0);
	for (int x = 1; x <= 10; ++x)
	{
		if (d * d - x * x >= 0)
		{
			double y = sqrt(max(0.0, d * d - x * x));
			if (y < 1.0)
			{
				y = 1.0;
			}
			ans = max(ans, x + y);
		}
	}
	printf("%.12lf\n", ans);
}

int main()
{
	solve();
	return(0);
}