{"problem":{"name":"DivRem Number","description":{"content":"Snuke received a positive integer $N$ from Takahashi. A positive integer $m$ is called a _favorite number_ when the following condition is satisfied: *   The quotient and remainder of $N$ divided by ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"diverta2019_d"},"statements":[{"statement_type":"Markdown","content":"Snuke received a positive integer $N$ from Takahashi. A positive integer $m$ is called a _favorite number_ when the following condition is satisfied:\n\n*   The quotient and remainder of $N$ divided by $m$ are equal, that is, $\\lfloor \\frac{N}{m} \\rfloor = N \\bmod m$ holds.\n\nFind all favorite numbers and print the sum of those.\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\leq N \\leq 10^{12}$\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":"diverta2019_d","tags":[],"sample_group":[["8","10\n\nThere are two favorite numbers: $3$ and $7$. Print the sum of these, $10$."],["1000000000000","2499686339916\n\nWatch out for overflow."]],"created_at":"2026-03-03 11:01:14"}}