Interleaving Strings

Background

During a programming practice session, Congcong encountered an interesting string processing problem. He needed to merge two given strings in a specific way.

Problem Description

Given two strings, $a$ and $b$, create a new string. The new string is formed by interleaving the first character of $a$, the first character of $b$, the second character of $a$, the second character of $b$, and so on. Any leftover characters from the longer string are appended to the end of the result.

Input Format

Input is given from standard input in the following format.

A single line containing two strings $a$ and $b$, separated by a space.

Output Format

Output is printed to standard output in the following format.

A new string formed by interleaving $a$ and $b$.

Sample

abc xyz

axbycz

Hi There

HTihere

xxxx There

xTxhxexre

Sample Explanation

For sample 1, string $a$ is abc and string $b$ is xyz. Interleaving them results in axbycz. For sample 2, string $a$ is Hi and string $b$ is There. First, interleave H and T, then i and h, resulting in HTih. String $a$ is exhausted. Append the remaining ere from string $b$ to the end, finally getting HTihere. For sample 3, string $a$ is xxxx and string $b$ is There. First, interleave x and T, x and h, x and e, x and r, resulting in xTxhxexr. String $b$ is exhausted. Append the remaining x from string $a$ to the end, finally getting xTxhxexre.

Constraints

Time limit: $1$ second. Memory limit: $1024$ KiB for each test case.