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 Go (1.6) (judge verdict: Wrong Answer)

package main

import (
	"fmt"
	_ "strings"
)

func main() {
	var n, str string
	fmt.Scanln(&n)
	fmt.Scanln(&str)

	//parts := strings.Split(str, " ")
	//fmt.Print(run(parts[0], parts[1]))

	fmt.Print(run2(str))
}

func run(a, b string) string {
	buf := make([]byte, len(a)+len(b))
	for i := 0; i < len(a); i++ {
		n := i * 2
		buf[n] = a[i]
		buf[n+1] = b[i]
	}
	return string(buf)
}

func run2(str string) string {
	secondStart := (len(str) + 1) / 2
	firstEnd := secondStart - 2
	buf := make([]byte, len(str)-1)
	for i := 0; i <= firstEnd; i++ {
		n := i * 2
		buf[n] = str[i]
		buf[n+1] = str[i+secondStart]
	}
	return string(buf)
}