Contest Duration: - (local time) (100 minutes) Back to Home
B - Strings with the Same Length /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

S1 文字目、T1 文字目、S2 文字目、T2 文字目、S3 文字目、...、SN 文字目、TN 文字目というように、 S の各文字と T の各文字を先頭から順に交互に文字を並べ、新しい文字列を作ります。この新しくできた文字列を出力してください。

### 制約

• 1 ≤ N ≤ 100
• |S| = |T| = N
• S, T は英小文字のみからなる文字列

### 入力

N
S T


### 入力例 1

2
ip cc


### 出力例 1

icpc


### 入力例 2

8
hmhmnknk uuuuuuuu


### 出力例 2

humuhumunukunuku


### 入力例 3

5
aaaaa aaaaa


### 出力例 3

aaaaaaaaaa


Score : 200 points

### Problem Statement

Given are strings s and t of length N each, both consisting of lowercase English letters.

Let us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.

### Constraints

• 1 \leq N \leq 100
• |S| = |T| = N
• S and T are strings consisting of lowercase English letters.

### Input

Input is given from Standard Input in the following format:

N
S T


### Output

Print the string formed.

### Sample Input 1

2
ip cc


### Sample Output 1

icpc


### Sample Input 2

8
hmhmnknk uuuuuuuu


### Sample Output 2

humuhumunukunuku


### Sample Input 3

5
aaaaa aaaaa


### Sample Output 3

aaaaaaaaaa