Problem9877--ABC306 —— A - Echo

9877: ABC306 —— A - Echo

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

Description

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

Input

The input is given from Standard Input in the following format:

```
$N$
$S$
```

Output

Print the answer.

Constraints

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

Sample 1 Input

8
beginner

Sample 1 Output

bbeeggiinnnneerr
It is the same as the example described in the problem statement.

Sample 2 Input

3
aaa

Sample 2 Output

aaaaaa

Source/Category