{"raw_statement":[{"iden":"problem statement","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 that there uniquely exists such a string under the Constraints of this problem."},{"iden":"constraints","content":"*   $S$ is a string consisting of lowercase English characters of length between $1$ and $3$, inclusive."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"abc"},{"iden":"sample output 1","content":"abcabc\n\nThese 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."},{"iden":"sample input 2","content":"zz"},{"iden":"sample output 2","content":"zzzzzz"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}