Problem Statement

You are given a string $S$ of length $N$ consisting of lowercase English letters.
We denote the $i$-th character of $S$ by Si.
Print the string of length $2N$ obtained by concatenating S1,S1,S2,S2,…,SN, and SN in this order.
For example, if $S$ is beginner, print bbeeggiinnnneerr.

Constraints

• $N$ is an integer such that $1\le N\le 50$.
• $S$ is a string of length $N$ consisting of lowercase English letters.