{"raw_statement":[{"iden":"problem statement","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."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq N \\leq 10^{12}$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"8"},{"iden":"sample output 1","content":"10\n\nThere are two favorite numbers: $3$ and $7$. Print the sum of these, $10$."},{"iden":"sample input 2","content":"1000000000000"},{"iden":"sample output 2","content":"2499686339916\n\nWatch out for overflow."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}