Two apprentice weavers, A and B, are collaborating on a single ceremonial tapestry. Weaver A holds a sequence of thread-color codes and Weaver B holds another. Starting with Weaver A, the two take turns adding exactly one thread-color code to the tapestry — first A's next code, then B's next code, and so on — until one of them runs out of codes. The weaver who still has codes left then adds all of their remaining codes, in order, to finish the tapestry. Given both weavers' thread-color sequences, determine the final tapestry sequence.

Input format

The first line contains a string a, Weaver A's thread-color sequence. The second line contains a string b, Weaver B's thread-color sequence. Both strings consist only of lowercase English letters.

Output format

Print a single string: the final tapestry sequence produced by alternating characters from a and b, starting with a, and appending any leftover characters from the longer string at the end.

Constraints

• 1 <= length of a, length of b <= 100
• a and b consist only of lowercase English letters ('a' to 'z')

abc
pqr

apbqcr

ab
pqrs

apbqrs