Problem:
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

Solution in Kotlin (1.0.0) (judge verdict: Accepted)

fun main (args : Array<String>) {
	val n = readLine()!!
	val (s, t) = readLine()!!.split(" ")
	var sList : MutableList<String> = mutableListOf()
	var tList : MutableList<String> = mutableListOf()
	var result : String = ""
	for (i in s) {
		sList.add(i.toString())
	}
	for (i in t) {
		tList.add(i.toString())
	}
	for (i in 0..(n.toInt() * 2) - 1) {
		if ((i % 2) == 0) {
			result += sList[0]
			sList.removeAt(0)
		} else {
			result += tList[0]
			tList.removeAt(0)
		}
	}
	println("${result}")
}