{"raw_statement":[{"iden":"problem statement","content":"Kurohashi has never participated in AtCoder Beginner Contest (ABC).\nThe next ABC to be held is ABC $N$ (the $N$\\-th ABC ever held). Kurohashi wants to make his debut in some ABC $x$ such that all the digits of $x$ in base ten are the same.\nWhat is the earliest ABC where Kurohashi can make his debut?"},{"iden":"constraints","content":"*   $100 \\leq N \\leq 999$\n*   $N$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"111"},{"iden":"sample output 1","content":"111\n\nThe next ABC to be held is ABC $111$, where Kurohashi can make his debut."},{"iden":"sample input 2","content":"112"},{"iden":"sample output 2","content":"222\n\nThe next ABC to be held is ABC $112$, which means Kurohashi can no longer participate in ABC $111$. Among the ABCs where Kurohashi can make his debut, the earliest one is ABC $222$."},{"iden":"sample input 3","content":"750"},{"iden":"sample output 3","content":"777"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}