在 Manhattan，對每個整數 $i$，都有街道 $x = i$ 和 $y = i$。已知 Snuke 的家和 Smeke 的家都位於街道上，且兩家的歐幾里得距離恰好為 $d$。計算沿街道行走時，兩家之間距離的最大可能值。
輸入包含一個數 $d$。
$0 < d \le 10$
$d$ 的小數點後恰好有三位數字。
輸出答案。如果答案的絕對誤差或相對誤差不超過 $10^{-9}$，就會被視為正確。
1.000
2.000000000000
2.345
3.316330803765
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: