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 Java (OpenJDK 11.0.6) (judge verdict: Accepted)

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String S = sc.next();
        String T = sc.next();
        List<String> listS=new ArrayList<String>();
        List<String> listT=new ArrayList<String>();
        List<String> listFinal = new ArrayList<String>();

        for(int i=0;i<S.length();i++){
            listS.add(String.valueOf(S.charAt(i)));
        }
        for(int i=0;i<T.length();i++){
            listT.add(String.valueOf(T.charAt(i)));
        }
        for(int i=0;i<N;i++){
            listFinal.add(listS.get(i));
            listFinal.add(listT.get(i));
        }
        listFinal.forEach(System.out::print);
    }
}