Six Characters

AtCoder

IDabc251_a

Time2000ms

Memory256MB

Difficulty—

You are given a string $S$ consisting of lowercase English characters. The length of $S$ is between $1$ and $3$, inclusive. Print the string of length $6$ that is a repetition of $S$. It can be shown that there uniquely exists such a string under the Constraints of this problem. ## Constraints * $S$ is a string consisting of lowercase English characters of length between $1$ and $3$, inclusive. ## Input Input is given from Standard Input in the following format: $S$ [samples]

Samples

Input #1

abc

Output #1

abcabc

These are strings that are repetitions of $S = $ `abc`: `abc`, `abcabc`, `abcabcabc`, `abcabcabcabc`, and so on. Among them, `abcabc` has the length of $6$, so `abcabc` should be printed.

Input #2

zz

Output #2

zzzzzz

API Response (JSON)

{
  "problem": {
    "name": "Six Characters",
    "description": {
      "content": "You are given a string $S$ consisting of lowercase English characters. The length of $S$ is between $1$ and $3$, inclusive. Print the string of length $6$ that is a repetition of $S$. It can be shown ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc251_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a string $S$ consisting of lowercase English characters. The length of $S$ is between $1$ and $3$, inclusive.\nPrint the string of length $6$ that is a repetition of $S$.\nIt can be shown ...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments