{"problem":{"name":"Sum of Two Integers","description":{"content":"How many ways are there to choose two distinct positive integers totaling $N$, disregarding the order?","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"nikkei2019_2_qual_a"},"statements":[{"statement_type":"Markdown","content":"How many ways are there to choose two distinct positive integers totaling $N$, disregarding the order?\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^6$\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":"nikkei2019_2_qual_a","tags":[],"sample_group":[["4","1\n\nThere is only one way to choose two distinct integers totaling $4$: to choose $1$ and $3$. (Choosing $3$ and $1$ is not considered different from this.)"],["999999","499999"]],"created_at":"2026-03-03 11:01:13"}}