{"problem":{"name":"Walk on Multiplication Table","description":{"content":"Takahashi is standing on a multiplication table with infinitely many rows and columns. The square $(i,j)$ contains the integer $i \\times j$. Initially, Takahashi is standing at $(1,1)$. In one move, h","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc144_c"},"statements":[{"statement_type":"Markdown","content":"Takahashi is standing on a multiplication table with infinitely many rows and columns.\nThe square $(i,j)$ contains the integer $i \\times j$. Initially, Takahashi is standing at $(1,1)$.\nIn one move, he can move from $(i,j)$ to either $(i+1,j)$ or $(i,j+1)$.\nGiven an integer $N$, find the minimum number of moves needed to reach a square that contains $N$.\n\n## Constraints\n\n*   $2 \\leq N \\leq 10^{12}$\n*   $N$ is an integer.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc144_c","tags":[],"sample_group":[["10","5\n\n$(2,5)$ can be reached in five moves. We cannot reach a square that contains $10$ in less than five moves."],["50","13\n\n$(5, 10)$ can be reached in $13$ moves."],["10000000019","10000000018\n\nBoth input and output may be enormous."]],"created_at":"2026-03-03 11:01:14"}}