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.

Examples

Input

xyz
abc


Output

xaybzc


Input

atcoderbeginnercontest
atcoderregularcontest


Output

aattccooddeerrbreeggiunlnaerrccoonntteesstt
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String[] odd = scanner.nextLine().split("");
        String[] even =  scanner.nextLine().split("");
        StringBuffer ans = new StringBuffer();
        for (int i = 0; i < odd.length; i++) {
            ans.append(odd[i]);
            if (even.length > i) {
                ans.append(even[i]);
            }
        }
        System.out.println(ans.toString());
    }
}
