AtCoder Beginner Contest 111

AtCoder

IDabc111_b

Time2000ms

Memory256MB

Difficulty—

Kurohashi has never participated in AtCoder Beginner Contest (ABC). The 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. What is the earliest ABC where Kurohashi can make his debut? ## Constraints * $100 \leq N \leq 999$ * $N$ is an integer. ## Input Input is given from Standard Input in the following format: $N$ [samples]

Samples

Input #1

Output #1

111

The next ABC to be held is ABC $111$, where Kurohashi can make his debut.

Input #2

Output #2

222

The 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$.

Input #3

Output #3

API Response (JSON)

{
  "problem": {
    "name": "AtCoder Beginner Contest 111",
    "description": {
      "content": "Kurohashi has never participated in AtCoder Beginner Contest (ABC). The 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 ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc111_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "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 ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments