102510: [AtCoder]ABC251 A - Six Characters

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $100$ points

Problem Statement

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$

Output

Print the answer string, which is of length $6$.


Sample Input 1

abc

Sample 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.


Sample Input 2

zz

Sample Output 2

zzzzzz

Input

题意翻译

输入一个长度在 $1$ 到 $3$ 之间的由英文小写字母组成的字符串 $s$ ,将 $s$ 重复输出(中间不断开,不换行,不加空格,不加任何字符,不改变原有字符串),直至输出的字符串长度刚好达到 $6$ 。可以证明,对于每种情况,输出的字符串都是唯一的。

Output

分数: 100分

问题描述

你得到了一个由小写英文字母组成的字符串$S$。字符串$S$的长度在1到3之间,包括1和3。

打印长度为6的字符串,它是$S$的重复。

可以证明,在本问题的约束下,这样的字符串是唯一存在的。

约束

  • $S$是一个由小写英文字母组成,长度在1到3之间的字符串。

输入

输入通过标准输入给出以下格式:

$S$

输出

打印答案字符串,长度为6。


样例输入1

abc

样例输出1

abcabc

这些是字符串$S=$ abc的重复: abc, abcabc, abcabcabc, abcabcabcabc, 等等。其中,abcabc的长度为6,所以应该打印abcabc


样例输入2

zz

样例输出2

zzzzzz

加入题单

算法标签: