{"problem":{"name":"A. Rounding","description":{"content":"Vasya has a non-negative integer _n_. He wants to round it to nearest integer, which ends up with 0. If _n_ already ends up with 0, Vasya considers it already rounded. For example, if _n_ = 4722 answ","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF898A"},"statements":[{"statement_type":"Markdown","content":"Vasya has a non-negative integer _n_. He wants to round it to nearest integer, which ends up with 0. If _n_ already ends up with 0, Vasya considers it already rounded.\n\nFor example, if _n_ = 4722 answer is 4720. If _n_ = 5 Vasya can round it to 0 or to 10. Both ways are correct.\n\nFor given _n_ find out to which integer will Vasya round it.\n\n## Input\n\nThe first line contains single integer _n_ (0 ≤ _n_ ≤ 109) — number that Vasya has.\n\n## Output\n\nPrint result of rounding _n_. Pay attention that in some cases answer isn't unique. In that case print any correct answer.\n\n[samples]\n\n## Note\n\nIn the first example _n_ = 5. Nearest integers, that ends up with zero are 0 and 10. Any of these answers is correct, so you can print 0 or 10.","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"Vasya 有一个非负整数 $n$。他希望将其四舍五入到最近的、以 $0$ 结尾的整数。如果 $n$ 已经以 $0$ 结尾，Vasya 认为它已经四舍五入。\n\n例如，如果 $n = 4722$，答案是 $4720$。如果 $n = 5$，Vasya 可以将其四舍五入到 $0$ 或 $10$，两种方式都是正确的。\n\n对于给定的 $n$，请找出 Vasya 会将其四舍五入到哪个整数。\n\n第一行包含一个整数 $n$（$0 ≤ n ≤ 10^9$）——Vasya 拥有的数字。\n\n请输出对 $n$ 四舍五入的结果。请注意，在某些情况下答案不唯一。在这种情况下，请输出任意一个正确答案。\n\n在第一个例子中，$n = 5$。以零结尾的最近整数是 $0$ 和 $10$。这两个答案都是正确的，因此你可以输出 $0$ 或 $10$。\n\n## Input\n\n第一行包含一个整数 $n$（$0 ≤ n ≤ 10^9$）——Vasya 拥有的数字。\n\n## Output\n\n请输出对 $n$ 四舍五入的结果。请注意，在某些情况下答案不唯一。在这种情况下，请输出任意一个正确答案。\n\n[samples]\n\n## Note\n\n在第一个例子中，$n = 5$。以零结尾的最近整数是 $0$ 和 $10$。这两个答案都是正确的，因此你可以输出 $0$ 或 $10$。","is_translate":true,"language":"Chinese"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z}_{\\geq 0} $ be the input integer.\n\n**Constraints**  \n$ 0 \\leq n \\leq 10^9 $\n\n**Objective**  \nFind an integer $ r $ such that:  \n- $ r \\equiv 0 \\pmod{10} $,  \n- $ |n - r| $ is minimized.  \n\nIf multiple such $ r $ exist, output any one.","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF898A","tags":["implementation","math"],"sample_group":[["5","0"],["113","110"],["1000000000","1000000000"],["5432359","5432360"]],"created_at":"2026-03-03 11:00:39"}}