Problem Statement
Given are strings ss and tt of length NN each, both consisting of lowercase English letters.
Let us form a new string by alternating the characters of SS and the characters of TT, as follows: the first character of SS, the first character of TT, the second character of SS, the second character of TT, ......, the NN-th character of SS, the NN-th character of TT. Print this new string.
Constraints
-
1 \leq N \leq 1001≤N≤100
-
|S| = |T| = N∣S∣=∣T∣=N
-
SS and TT are strings consisting of lowercase English letters.
Input
Input is given from Standard Input in the following format:
NNSSTT
Output
Print the string formed.