You are given a string $S$ of length $N$ consisting of lowercase English letters. We denote the $i$\-th character of $S$ by $S_i$. Print the string of length $2N$ obtained by concatenating $S_1,S_1,S_2,S_2,\dots,S_N$, and $S_N$ in this order. For example, if $S$ is `beginner`, print `bbeeggiinnnneerr`.

The input is given from Standard Input in the following format: >$N$\ >$S$ #### Constraints - $N$ is an integer such that $1 \le N \le 50$. - $S$ is a string of length $N$ consisting of lowercase English letters.

Print the answer.

***For Sample #1:*** It is the same as the example described in the problem statement.

AtCoder [ABC306A]