Score : $100$ points
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.
Input is given from Standard Input in the following format:
Print the answer string, which is of length $6$.
These are strings that are repetitions of $S = $
abcabcabcabc, and so on.
abcabc has the length of $6$, so
abcabc should be printed.