#abc306a. A - Echo

A - Echo

Score : 100100 points

问题描述

你将得到一个长度为 NN 的字符串 SS,由小写英文字母组成。
我们将 SS 的第 ii 个字符记为 SiS_i
请按照此顺序拼接 S1,S1,S2,S2,,SNS_1,S_1,S_2,S_2,\dots,S_NSNS_N,并输出得到的长度为 2N2N 的字符串。
例如,若 SSbeginner,则应输出 bbeeggiinnnneerr

以上为通义千问 qwen-max 翻译,仅供参考。

Problem Statement

You are given a string SS of length NN consisting of lowercase English letters.
We denote the ii-th character of SS by SiS_i.
Print the string of length 2N2N obtained by concatenating S1,S1,S2,S2,,SNS_1,S_1,S_2,S_2,\dots,S_N, and SNS_N in this order.
For example, if SS is beginner, print bbeeggiinnnneerr.

Constraints

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

Input

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

NN

SS

Output

Print the answer.

Sample Input 1

8
beginner

Sample Output 1

bbeeggiinnnneerr

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

Sample Input 2

3
aaa

Sample Output 2

aaaaaa

update @ 2024/3/10 08:38:03