Problem:
Score : 200 points

Problem Statement

Snuke signed up for a new website which holds programming competitions.
He worried that he might forget his password, and he took notes of it.
Since directly recording his password would cause him trouble if stolen,
he took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.

You are given two strings O and E. O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.
Restore the original password.

Constraints

O and E consists of lowercase English letters (a - z).

1 \leq |O|,|E| \leq 50

|O| - |E| is either 0 or 1.

Input

Input is given from Standard Input in the following format:

O
E

Output

Print the original password.

Sample Input 1

xyz
abc

Sample Output 1

xaybzc

The original password is xaybzc. Extracting the characters at the odd-numbered positions results in xyz, and extracting the characters at the even-numbered positions results in abc.

Sample Input 2

atcoderbeginnercontest
atcoderregularcontest

Sample Output 2

aattccooddeerrbreeggiunlnaerrccoonntteesstt

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using static System.Console;
using System.Collections.Generic;
using System.Linq;

namespace Atcoder
{
    class Program
    {
        static void Main(string[] args)
        {
            var o = ReadLine();
            var e = ReadLine();
            string ans = "";

            if (o.Length == e.Length)
            {
                for (int i = 0; i < o.Length; i++)
                {
                    ans += o[i];
                    ans += e[i];
                }
            }
            else if (Math.Max(o.Length, e.Length) == o.Length)
            {
                for (int i = 0; i < e.Length; i++)
                {
                    ans += o[i];
                    ans += e[i];
                }
                ans += o[o.Length - 1];
            }
            else if (Math.Max(o.Length, e.Length) == e.Length)
            {
                for (int i = 0; i < o.Length; i++)
                {
                    ans += o[i];
                    ans += e[i];
                }
                ans += e[e.Length - 1];
            }
            WriteLine(ans);
        }

        static int InputNum()
        {
            return int.Parse(ReadLine());
        }
        static List<int> InputNumList()
        {
            return ReadLine().Split(' ').Select(int.Parse).ToList();
        }
    }
}