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 Rust (1.15.1) (judge verdict: Accepted)

use std::io;

fn main() {
    let n = parse_line::<usize>();
    let st = parse_line::<String>();
    solve(st, n);
}

fn parse_line<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn solve(st: String, n: usize) {
    let split: Vec<&str> = st.split_whitespace().collect();
    let mut s = split[0].chars();
    let mut t = split[1].chars();
    loop {
        let cs = s.next();
        if cs.is_none() {
            break;
        };
        let ts = t.next().unwrap();
        print!("{}", cs.unwrap());
        print!("{}", ts);
    }
    println!();
}