

def examB():

    O = S()

    E = S()

    E += " "

    ans = ""

    for i in range(len(O)):

        ans = ans + O[i] + E[i]

    if len(O)!=len(O):

        ans = ans[:len(E)+1]

    print(ans)







import sys

import copy

import bisect

from collections import Counter,defaultdict,deque

def I(): return int(sys.stdin.readline())

def LI(): return list(map(int,sys.stdin.readline().split()))

def LS(): return sys.stdin.readline().split()

def S(): return sys.stdin.readline().strip()

mod = 10**9 + 7

inf = float('inf')



examB()

def examA():

    O = SI()

    E = SI()

    ans = ""

    for i in range(len(O)+len(E)):

        if i%2==0:

            ans += O[i//2]

        else:

            ans += E[i//2]

    print(ans)

    return



def examB():

    ans = 0

    print(ans)

    return



def examC():

    ans = 0

    print(ans)

    return



def examD():

    ans = 0

    print(ans)

    return



def examE():

    ans = 0

    print(ans)

    return



def examF():

    ans = 0

    print(ans)

    return



import sys,bisect,itertools,heapq,math,random

from copy import deepcopy

from heapq import heappop,heappush,heapify

from collections import Counter,defaultdict,deque

def I(): return int(sys.stdin.readline())

def LI(): return list(map(int,sys.stdin.readline().split()))

def LSI(): return list(map(str,sys.stdin.readline().split()))

def LS(): return sys.stdin.readline().split()

def SI(): return sys.stdin.readline().strip()

global mod,mod2,inf,alphabet,_ep

mod = 10**9 + 7

mod2 = 998244353

inf = 10**18

_ep = 10**(-12)

alphabet = [chr(ord('a') + i) for i in range(26)]



sys.setrecursionlimit(10**6)



if __name__ == '__main__':

    examA()



"""



"""
def examB():
    O = S()
    E = S()
    E += " "
    ans = ""
    for i in range(len(O)):
        ans = ans + O[i] + E[i]
    if len(O) != len(O):
        ans = ans[: len(E) + 1]
    print(ans)


import sys
import copy
import bisect
from collections import Counter, defaultdict, deque


def I():
    return int(sys.stdin.readline())


def LI():
    return list(map(int, sys.stdin.readline().split()))


def LS():
    return sys.stdin.readline().split()


def S():
    return sys.stdin.readline().strip()


mod = 10**9 + 7
inf = float("inf")
examB()

def examA():
    O = SI()
    E = SI()
    ans = ""
    for i in range(len(O) + len(E)):
        if i % 2 == 0:
            ans += O[i // 2]
        else:
            ans += E[i // 2]
    print(ans)
    return


def examB():
    ans = 0
    print(ans)
    return


def examC():
    ans = 0
    print(ans)
    return


def examD():
    ans = 0
    print(ans)
    return


def examE():
    ans = 0
    print(ans)
    return


def examF():
    ans = 0
    print(ans)
    return


import sys, bisect, itertools, heapq, math, random
from copy import deepcopy
from heapq import heappop, heappush, heapify
from collections import Counter, defaultdict, deque


def I():
    return int(sys.stdin.readline())


def LI():
    return list(map(int, sys.stdin.readline().split()))


def LSI():
    return list(map(str, sys.stdin.readline().split()))


def LS():
    return sys.stdin.readline().split()


def SI():
    return sys.stdin.readline().strip()


global mod, mod2, inf, alphabet, _ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10 ** (-12)
alphabet = [chr(ord("a") + i) for i in range(26)]
sys.setrecursionlimit(10**6)
if __name__ == "__main__":
    examA()
"""
"""

-def examB(): -    O = S() -    E = S() -    E += " " +def examA(): +    O = SI() +    E = SI() -    for i in range(len(O)): -        ans = ans + O[i] + E[i] -    if len(O) != len(O): -        ans = ans[: len(E) + 1] +    for i in range(len(O) + len(E)): +        if i % 2 == 0: +            ans += O[i // 2] +        else: +            ans += E[i // 2] +    return -import sys -import copy -import bisect +def examB(): +    ans = 0 +    print(ans) +    return + + +def examC(): +    ans = 0 +    print(ans) +    return + + +def examD(): +    ans = 0 +    print(ans) +    return + + +def examE(): +    ans = 0 +    print(ans) +    return + + +def examF(): +    ans = 0 +    print(ans) +    return + + +import sys, bisect, itertools, heapq, math, random +from copy import deepcopy +from heapq import heappop, heappush, heapify +def LSI(): +    return list(map(str, sys.stdin.readline().split())) + + -def S(): +def SI(): +global mod, mod2, inf, alphabet, _ep -inf = float("inf") -examB() +mod2 = 998244353 +inf = 10**18 +_ep = 10 ** (-12) +alphabet = [chr(ord("a") + i) for i in range(26)] +sys.setrecursionlimit(10**6) +if __name__ == "__main__": +    examA() +""" +"""