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 (Python):
o = str(input())
e = str(input())
l = []
if len(o) == len(e):
    for i in range(len(o)):
        l.append(o[i]+e[i])
    print("".join(l))
else:
    for i in range(len(e)):
        l.append(o[i]+e[i])
    print("".join(l)+o[-1])

Solution (Python):
o = input()
e = input()
diff = abs(len(o) - len(e))
ans = [o[i]+e[i] for i in range(len(e))]
print(''.join(ans) if diff == 0 else ''.join(ans) + o[-1])

Solution (Python):




import sys


class math:
    
    pi = 3.14159265358979323846264338

    
    def gcd(self, a, b):
        if b == 0:
            return a
        return self.gcd(b, a%b)

    
    def lcm(self, a, b):
        return (a*b)//self.gcd(a,b)

    
    def Pnum(self, a):
        if a == 1: return False
        for i in range(2,int(a**0.5)+1):
            if a % i == 0:
                return False
        return True

    
    def caria(self, r):
        return r*r*self.pi

math = math()


class output:
    
    def list(self, l):
        l = list(l)
        print(" ", end="")
        for i, num in enumerate(l):
            print(num, end="")
            if i != len(l)-1:
                print(" ", end="")
        print()

output = output()

















O = input()
E = input()

for i in range(len(O)):
    print(O[i], end="")
    if len(E) > i:
        print(E[i], end="")
print("")

Solution (Python):
O = str(input())
E = str(input())

flg = 0
N = max(len(O), len(E))
if len(O) > len(E):
  flg = 1

ans = ''
if flg:
  for i in range(N):
    if i == N-1:
      ans += O[i]
    else:
      ans += O[i] + E[i]
else:
  for i in range(N):
    ans += O[i] +E[i]
print(ans)

Solution (Python):
A=input()
B=input()

C=[]
for i in range(len(A)):
    C.append(A[i])
    if len(B)-1 >= i:
        C.append(B[i])
print("".join(C))

Solution (Python):
o=input()
e=input()
ans=""
if len(o)==len(e):
    for i in range(len(e)):
        ans+=o[i]+e[i]
else:
    for j in range(len(e)):
        ans+=o[j]+e[j]
    ans+=o[-1]
print(ans)

Solution (Python):
O,E = input(),input()
ans = ""
for i,e in enumerate(E):
    ans += O[i]+e
if len(O)>len(E):
    ans += O[-1]
print(ans)

Solution (Python):
o = input()
e = input()
s = ""
for i in range(len(o)-1):
  s += o[i] + e[i]
if len(o) > len(e):
  s += o[len(o)-1]
else:
  s += o[len(o)-1]+e[len(o)-1]
print(s)

Solution (Python):
o = [c  for c in input()]
e = [c  for c in input()]

j = 0
for i in range(len(o)):
    e.insert(j, o[i])
    j = j + 2

print(''.join(e))

Solution (Python):

O=list(input())
E=list(input())

s=''
while True:
  
  if len(O)==0 and len(E)==0:
    break

  if len(O)!=0:
    s+=O[0]
    O.remove(O[0])

  if len(E)!=0:
    s+=E[0]
    E.remove(E[0])


print(s)

Solution (Python):
o = list(input())
e = list(input())
ans = ""

while True:
	if len(o) == 0 and len(e) == 0:
		break
		
	if len(o) != 0:
		ans = ans + o[0]
		o.remove(o[0])
	if len(e) != 0:
		ans = ans + e[0]
		e.remove(e[0])
print(ans)

Solution (Python):
O, Q = list(input()), list(input()) + [""]
for i, j in zip(O, Q):
    print(i+j, end="")

Solution (Python):
o = list(input())
e = list(input())
psw = ['0']*(len(o)+len(e))

for i in range(len(o)):
    j = i * 2
    psw[j] = o[i]
for i in range(len(e)):
    j = i * 2 + 1
    psw[j] = e[i]

print(*psw, sep='')

Solution (Python):

O=list(input())
E=list(input())

s=''
while True:
    
    if len(O)==0 and len(E)==0:
        break

    if len(O)!=0:
        s+=O[0]
        O.remove(O[0])

    if len(E)!=0:
        s+=E[0]
        E.remove(E[0])


print(s)

Solution (Python):
a=list(input())
b=list(input())
ans=[]
for i in range(len(a)):
    ans.append(a[i])
    if i < len(b):
        ans.append(b[i])
print(''.join(ans))

Solution (Python):
O = input()
E = input()
s = ''
for i in range(len(E)):
  s+=O[i]+E[i]
if(len(O)>len(E)):
  s+=O[-1]
print(s)

Solution (Python):
o=input()
e=input()
t=[]
for i in range(1,len(o)+len(e)+1):
    if i%2==1:
        t.append(o[i//2])
    else:
        t.append(e[i//2-1])
print(''.join(t))

Solution (Python):
o=input()
e=input()
a,b=len(o),len(e)
if a==b:
    print("".join([o[i]+e[i] for i in range(a)]))
elif a>b:
    print("".join([o[i]+e[i] for i in range(b)])+o[-1])
else:
    print("".join([o[i]+e[i] for i in range(a)])+e[-1])

Solution (Python):
o = input()
e = input()

ans = ''
for i in range(len(e)):
    ans += o[i] + e[i]

if len(o) > len(e):
    ans += o[-1]

print(ans)

Solution (Python):
O = input()
E = input()
print(('{}'.join(O)+'{}'*(len(O)==len(E))).format(*E))

Solution (Python):
odd = list(input())
even = list(input()) + [""]
s = ""
for o, e in zip(odd, even):
  s += (o + e)
print(s)

Solution (Python):
o=list(input())
e=list(input())+['']
for x,y in zip(o,e):
    print(x+y,end='')

Solution (Python):

a = input()
b = input()

for i in range(len(b)):
    print(a[i],end="")
    print(b[i],end="")
    
if len(a)-len(b)>0:
    print(a[len(a)-1])
else:
    print("")

Solution (Python):
o = input()
e = input()
ans = ''

for i in range(len(o+e)):
	if i%2 == 0:
		ans += o[i//2]
	else:
		ans += e[i//2]
print(ans)

Solution (Python):
O = input()
E = input()
password = ""
if len(O) == len(E):
    for _ in range(len(O)):
        password += O[_] + E[_]
else:
    for _ in range(len(O) - 1):
        password += O[_] + E[_]
    password += O[-1]
print(password)

Solution (Python):
o=list(input())
e=list(input())+[""]
for oi, ei in zip(o, e):
    print(oi+ei,end="")

Solution (Python):
O = input()
E = input()
P = []
for i in range(1, len(O) + len(E) + 1):
    if i % 2 == 0:
        P.append(E[i // 2 - 1])
    else:
        P.append(O[i // 2])
print(''.join(P))

Solution (Python):
O = input()
E = input()

for o,e in zip(O,E):
    print(o+e, end='')
if len(O) > len(E):
    print(O[-1])

Solution (Python):
O = input()
E = input()
l = len(O)+len(E)

o = ""
for i in range(l):
    o += [O,E][i%2][i//2]

print(o)

Solution (Python):


o = list(str(input()))
e = list(str(input()))
i = 1
while len(o)>0 or len(e)>0:
  if i%2==1:
    print(o[0],end="")
    o = o[1:]
  else:
    print(e[0],end="")
    e = e[1:]
  i+=1
print()

Solution (Python):

o, e = [list(input().rstrip()) for _ in range(2)]
ans = []
for i in range(min(len(o), len(e))):
    ans.append(o[i])
    ans.append(e[i])
if len(o) - len(e):
    ans.append(o[-1])
print("".join(ans))

Solution (Python):
o = input()
e = input()
ans = ""
if not len(e) == len(o):
    e += " "
for s, t in zip(o, e):
    ans += s + t
ans = ans.strip()
print(ans)

Solution (Python):
import sys
from collections import Counter

o = input()
e = input()
ans = []

for i in range(len(o)):
    ans.append(o[i])
    try:
        ans.append(e[i])
    except IndexError:
        pass

print(''.join(ans))

Solution (Python):
S1 = input()
S2 = input()
ans = ""
for i, j in zip(S1, S2):
  ans += i + j

if len(S1) > len(S2):
  ans += S1[-1]
elif len(S1) < len(S2):
  ans += S2[-1]
print(ans)

Solution (Python):
O = input()
E = input()

ans = ""
for i in range(len(E)):
    ans += O[i]
    ans += E[i]
if len(O) > len(E):
    ans += O[-1]

print(ans)

Solution (Python):
O = input()
E = list(input())+['']

for i in range(len(O)):
    print(O[i],end='')
    print(E[i],end='')
print()

Solution (Python):
O = list(str(input()))
E = list(str(input()))
lists = []
if (len(O) - len(E)) == 0:
    for i in range(len(O)):
        lists.append(O[i])
        lists.append(E[i])
else:
    E.append(";")
    for i in range(len(O)):
        lists.append(O[i])
        lists.append(E[i])
    del lists[-1]
print("".join(lists))

Solution (Python):
O = input()
E = input()
if len(O) > len(E):
    for i in range(len(E)):
        print(O[i],end="")
        print(E[i],end="")
    print(O[-1])
elif len(O) < len(E):
    for i in range(len(O)):
        print(O[i],end="")
        print(E[i],end="")
    print(E[-1])
else:
    for i in range(len(O)):
        print(O[i],end="")
        print(E[i],end="")
    print()

Solution (Python):

def read_input():
    o = input().strip()
    e = input().strip()

    return o, e

def submit():
    o, e = read_input()

    result = []

    for oc, ec in zip(o, e):
        result.append(oc)
        result.append(ec)

    if len(o) != len(e):
        result.append(o[-1])

    print(''.join(result))

if __name__ == '__main__':
    submit()

Solution (Python):
O = list(input())
E = list(input())

S = []
for o, e in zip(O, E):
    S += [o, e]

len(O)
len(E)

if len(O) == len(E):
    print(''.join(S))
else:
    print(''.join(S+[O[-1]]))

Solution (Python):
print(''.join(map(''.join,zip(input(),input()+' '))))

Solution (Python):
o = input()
e = input()
lo = len(o)
le = len(e)
s = ''
for i in range(min(lo, le)):
    s += o[i] + e[i]
if lo > le:
    s += o[-1]
print(s)

Solution (Python):
a = list(input())
b = list(input()) + [""]
print(''.join([x+y for x , y in zip(a,b)]))

Solution (Python):
s = input()
t = input()
x = ''
if len(s) == len(t):
  for i in range(len(s)):
    x += s[i]
    x += t[i]
elif len(s) > len(t):
  for i in range(len(t)):
    x += s[i]
    x += t[i]
  x += s[-1]
else:
  for i in range(len(s)):
    x += s[i]
    x += t[i]
  x += t[-1]
print(x)

Solution (Python):
O, E = input(), input()
ans = ""
for i in range(len(O) + len(E)):
	if i % 2 == 0:
		ans += O[i // 2]
	else:
		ans += E[i // 2]
print(ans)

Solution (Python):
o=list(input())
e=list(input())+[""]
for x,y in zip(o,e):print(x+y,end="")

Solution (Python):
O = input()
E = input()
ans = ""
for i in range(len(E)):
    ans += O[i] + E[i]
if len(O) != len(E):
    ans += O[-1]
print(ans)

Solution (Python):



def main():
    O = input()
    E = input()

    ans = ''
    for o, e in zip(O, E):
        ans += o + e

    if len(O) > len(E):
        ans += O[-1]
    elif len(O) < len(E):
        ans += E[-1]
    elif len(O) == len(E):
        pass

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
O = input()
E = input()

S = ''
for i in range(len(E)):
    S += O[i] + E[i]

if len(O) > len(E):
    S += O[len(O) - 1]
    
print(S)

Solution (Python):
O = input()
E = input()

ans =''
for i, j in zip(O, E):
    ans += i+j

if len(O) != len(E):
    ans += O[-1]

print(ans)

Solution (Python):
O = input()
E = input()

no = len(O)
ne = len(E)

ans = ''
for i in range(ne):
    ans += O[i]
    ans += E[i]

if no > ne:
    ans += O[-1]

print(ans)

Solution (Python):
from itertools import zip_longest

o = input()
e = input()
for x,y in zip_longest(o, e, fillvalue=""):
    print(x+y, end="")
print("")

Solution (Python):
O=list(input())
E=list(input())
a=[]

if len(O)-len(E)==0:
    for i in range(len(O)):
        a.append(O[i])
        a.append(E[i])
else:
    for i in range(len(O)-1):
        a.append(O[i])
        a.append(E[i])
    a.append(O[len(O)-1])
b=''
for x in a:
    b += x

print(b)

Solution (Python):
from functools import reduce
from itertools import zip_longest
from operator import add

print(reduce(add, [o + (e or "") for o,e in zip_longest(input(),input())]))

Solution (Python):
o = list(input())
e = list(input())
 
oe = list()
 
while len(o) > 0 or len(e) > 0:
    if len(o) > len(e):
        oe.append(o.pop())
    else:
        oe.append(e.pop())
 
oe.reverse()
print(''.join(oe))

Solution (Python):
o = list(input())
e = list(input())

oe = list()

while len(o) > 0 or len(e) > 0:
    if len(o) > len(e):
        oe.append(o.pop())
    else:
        oe.append(e.pop())

oe.reverse()
print(''.join(oe))

Solution (Python):
a,s=input(),input()
if len(a)==len(s):
    ans=[a[i]+s[i] for i in range(len(a))]
else:
    ans=[a[0]]+[s[i]+a[i+1] for i in range(len(s))]
print("".join(ans))

Solution (Python):
o=input()
e=input()
p=[]
for i in range(len(e)):
   p.append(o[i])
   p.append(e[i])
if len(o)>len(e):
    p.append(o[-1])
print(''.join(p))

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    o = input()
    e = input()

    tlen = len(o) + len(e)
    for i in range(tlen):
        if i%2 == 0:
            print(o[i//2], end = '')
        else:
            print(e[i//2], end = '')

solve()

Solution (Python):
A=input()
B=input()
print("".join(B[i//2]if i%2 else A[i//2]for i,_ in enumerate(A+B)))

Solution (Python):
a = input()
b = input()
c = list(a) +list(b)
d = []
for i in range(len(c)):
    if i%2 == 0:
        d.append(c[int(i/2)])
    else:
        d.append(c[int(i/2)+len(a)])
print(''.join(d))

Solution (Python):
O = input()
E = input()
pas = ""
for i in range(len(E)):
    pas += O[i]+E[i]
if len(O)>len(E):
    pas += O[-1]
print(pas)

Solution (Python):
o = input()
e = input()
ans = [""]*100
for i in range(len(o)):
    ans[2*i]+=o[i]
for j in range(len(e)):
    ans[2*j+1]+=e[j]
print("".join(ans))

Solution (Python):
o=list(input()) + [""]
e=list(input()) + [""]
for i,j in zip(o,e):
	print(i+j, end="")

Solution (Python):

a=input()
b=input()
ans=""

for i in range(len(a)):
    ans+=a[i:i+1]
    ans+=b[i:i+1]

print(ans)

Solution (Python):
O=input()
E=input()
ANS=["" for i in range(100)]

for i in range(len(O)):
    ANS[i*2]=O[i]

for i in range(len(E)):
    ANS[i*2+1]=E[i]


print("".join(ANS))

Solution (Python):
p1=input()
p2=input()
ans=""
if len(p1)==len(p2):
    for i in range(len(p1)):
        ans+=p1[i]
        ans+=p2[i]
else:
    for i in range(len(p1)-1):
        ans+=p1[i]
        ans+=p2[i]
    ans+=p1[-1]
print(ans)

Solution (Python):
o = input().rstrip()
e = input().rstrip()
s = ""
for i in range(len(e)):
    s += o[i] + e[i]
if len(o) != len(e):
    s += o[-1]
print(s)

Solution (Python):
odd = list(input())
even = list(input())+ [""]

for x, y in zip(odd, even):
  print(x+y, end="")

Solution (Python):
s1=input()
s2=input()
ans=''
for i in range(len(s2)):
  ans+=s1[i]
  ans+=s2[i]
if len(s1)-len(s2)==1:
  ans+=s1[-1]
print(ans)

Solution (Python):
from itertools import zip_longest
O = input()
E = input()
print("".join([(o or "") + (e or "") for o, e in zip_longest(O, E)]))

Solution (Python):
o = list(input())
e = list(input()) + [""]
for x,y in zip(o,e):print(x+y,end="")

Solution (Python):
o = list(input())
e = list(input())

ans = []
for i in range(len(o)):
  ans.append(o[i])
  if i < len(o)-1:
    ans.append(e[i])
  else:
    if len(e) == len(o):
      ans.append(e[i])
    
print("".join(ans))

Solution (Python):
o = list(input())
e = list(input())+[""]
for x,y in zip(o,e):
  print(x+y,end="")

Solution (Python):
O=input()
E=input()
for i in range(len(O)+len(E)):
  if i%2==0:
    print(O[int(i/2)],end="")
  else:
    print(E[int((i-1)/2)],end="")

Solution (Python):
from functools import reduce
import math

def main():
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    O = list(_ for _ in input())
    E = list(_ for _ in input())
    ans = []
    for i in range(len(E)):
        ans.append(O[i])
        ans.append(E[i])
    if(len(O)>len(E)):
        ans.append(O[-1])
    print(''.join(ans))
    
if __name__ == '__main__':
    main()

Solution (Python):
O=input()
E=input()
ans=""
if len(O)==len(E):
    for i in range(len(O)):
        ans+=O[i]
        ans+=E[i]

    print(ans) 
else:
    for i in range(len(E)):
        ans+=O[i]
        ans+=E[i]
        
    ans+=O[len(O)-1]
    print(ans)

Solution (Python):
O = input()
E = input()
if len(O) == len(E):
    for i in range(len(O)):
        print(O[i] + E[i], end='')
else:
    for i in range(len(E)):
        print(O[i] + E[i], end='')
    print(O[-1:])

Solution (Python):
O = input()
E = input()

res = ""
o_cnt = 0
e_cnt = 0
while True:
    if o_cnt == len(O) and e_cnt == len(E):
        break
    if o_cnt < len(O):
        res += O[o_cnt]
        o_cnt += 1

    if e_cnt < len(E):
        res += E[e_cnt]
        e_cnt += 1

print(res)

Solution (Python):
o = list(input())
e = list(input())+[""]

for x,y in zip(o,e):
    print(x+y,end="")

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    O = str(input().strip())
    E = str(input().strip())

    ans = ''
    for i in range(len(O)):
        if i == len(O) - 1 and len(O) != len(E):
            ans += O[i]

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

    return ans


if __name__ == '__main__':
    print(main())

Solution (Python):
O=input()
E=input()
s=''
if len(O)-len(E)==1:
    for o,e in zip(O[:-1],E):
        s+=o+e
    s+=O[-1]
else:
    for o,e in zip(O,E):
        s+=o+e
print(s)

Solution (Python):
O = input()
E = input()
ans = ''
for i in range(len(O)):
	ans += O[i:i+1] + E[i:i+1]
print(ans)

Solution (Python):
o=input()
e=input()
ans=''
for i in range(min(len(o),len(e))):
  ans+=o[i]
  ans+=e[i]
if len(o)>len(e):
  ans+=o[-1]
print(ans)

Solution (Python):
import sys

ni = lambda: int(sys.stdin.readline().rstrip())
nm = lambda: map(int, sys.stdin.readline().split())
nl = lambda: list(nm())
ns = lambda: sys.stdin.readline().rstrip()

o = list(ns())
e = list(ns())
ans = ''
for i in range(len(e)):
    ans += o[i] + e[i]
if len(o) > len(e):
    ans += o[-1]
print(ans)

Solution (Python):
o = str(raw_input())
e = str(raw_input())
s = ''
for i in range(len(e)):
	s = s + o[i] + e[i]
if len(o) > len(e):
	s += o[-1]
print s

Solution (Python):
s = input()
t = input()
ans = ""
for i in range(min(len(s),len(t))):
    ans += s[i]
    ans += t[i]
if len(s) != min(len(s),len(t)):
    ans += s[-1]
elif len(t) != min(len(s),len(t)):
    ans += t[-1]

print(ans)

Solution (Python):
j=''.join;print(j(map(j,zip(*open(0)))))

Solution (Python):
O, E = input(), input()

ans = ''
if len(O) == len(E):
  for i in range(len(O)):
    ans += O[i]
    ans += E[i]
elif len(O) - len(E) == 1:
  for i in range(len(E)):
    ans += O[i]
    ans += E[i]
  else:
    ans+=O[-1]
    
print(ans)

Solution (Python):
list_o=list(input())
list_e=list(input())+[""]

for a,b in zip(list_o,list_e):print(a + b,end="")

Solution (Python):
O, E = [input() for _ in range(2)]
rest_str = ''

for i in range(len(O)):
    try:
        rest_str += O[i]+E[i]
    except IndexError:
        rest_str += O[i]

print(rest_str)

Solution (Python):
"""
変数Oは奇数、Eは偶数番目の文字列
各変数を結合して、、元の文字列を復元する。
"""


O, E = [input() for _ in range(2)]

rest_str = ''
for i in range(len(O)):
    try:
        rest_str += O[i]+E[i]
    except IndexError:
        rest_str += O[i]

print(rest_str)

Solution (Python):
a = list(input())
b = list(input())

c = []

aa = len(a)
bb = len(b)

if aa == bb:
    for i in range(aa):
        x = a[i] 
        y = b[i]
        c.append(x)
        c.append(y)
else:
    m = a.pop(-1)
    for i in range(aa -1):
        x = a[i] 
        y = b[i]
        c.append(x)
        c.append(y)
    c.append(m)
        
print(''.join(c))

Solution (Python):
O = input()
E = input()

ans = ''
for i in range(len(E)):
    ans += O[i]
    ans += E[i]

if len(O) > len(E):
    ans += O[-1]

print(ans)

Solution (Python):
O = list(input())
E = list(input()) + [""]

for x, y in zip(O, E):
    print(x + y, end="")

Solution (Python):
o=list(input())
e=list(input())+[""]
for x,y in zip(o,e):print(x+y,end="")

Solution (Python):
a = input()
b = input()

c = ""

for i in range(len(b)):
  c = c + a[i] + b[i]

if len(a) > len(b):
  c = c + a[-1]

print(c)

Solution (Python):
O, E = list(input()), list(input())
p = []
for i, o in enumerate(O):
	p.append(o)
	if i < len(E):
		p.append(E[i])
print("".join(p))

Solution (Python):
a=list(input())
b=list(input())
flag_a=0
flag_b=0
for i in range(len(a)+len(b)):
  
  if(flag_a==flag_b):
    print(a[flag_a],end="")
    flag_a+=1
  else:
    print(b[flag_b],end="")
    flag_b+=1
print("")

Solution (Python):
print(''.join(sum(map(list,zip(input(),input()+' ')),[])))

Solution (Python):


o = list(input())
e = list(input())

password = []

for i in range(len(o) + len(e)):
    if i % 2 == 1:
        password.append(e[i//2])
    else:
        password.append(o[i//2])

print("".join(password))

Solution (Python):
o = input()
e = input()
s = ""
for i in range(len(e)):
    s += o[i]
    s += e[i]
if len(e) < len(o):
    s += o[-1]
print(s)

Solution (Python):
o = input()
e = input()

for i in range(len(e)):
    print(o[i], e[i], sep="",end="")
if len(o) != len(e):
    print(o[-1])
else :
    print()

Solution (Python):


s = ''

O = input()
E = input()
for o, e in zip(O, E):
    s += o+e
print(s if len(O) == len(E) else s + O[-1])

Solution (Python):
o=input()
e=input()
ans=""
for i in range(len(o)+len(e)):
  ans+=o[i//2] if i%2<1 else e[i//2]
print(ans)

Solution (Python):
def password(O: str, E: str)->str:
    ret = ''
    for i in range(len(E)*2):
        if i % 2:
            ret += E[i//2]
        else:
            ret += O[i//2]
    return ret + (O[-1] if len(E) < len(O) else '')


if __name__ == "__main__":
    O = input()
    E = input()
    ans = password(O, E)
    print(ans)

Solution (Python):

from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007


"""
a,b,c = LI()
if b-a == c-b:
    print("YES")
else:
    print("NO")
"""

o = S()
e = S()
for i in range(len(e)):
    o.insert(2*i+1,e[i])
for i in o:
    print(i,end = "")
print()

"""
n = I()
s = SR(n)
for i in range(n):
    for j in range(len(s[i])):
        while s[i][j] in s[i][:j]:
            s[i][j] = "0"+s[i][j]
ans = set(s[0])
for i in range(1,n):
    ans &= set(s[i])
ans = sorted(list(ans))
if len(ans) == 0:print()
else:
    for i in range(len(ans)):
        ans[i] = ans[i][-1]
    ans.sort()
    for i in range(len(ans)-1):
        print(ans[i],end = "")
    print(ans[-1])
"""


"""
n,m = LI()
ln = [n-1]
lm = [m-1]
a = n-1
b = m-1
while a > 2:
    a -= 2
    ln.append(ln[-1]+a)
while b > 2:
    b -= 2
    lm.append(lm[-1]+b)
la = len(ln)
lb = len(lm)
for i in range(la):
    if i or a == 2:
        ln.append(ln[la-i-1])
for i in range(lb):
    if i or b == 2:
        lm.append(lm[lb-i-1])
x,y = LIR(2)
lx = 0
ly = 0
for i in range(n-1):
    lx += ln[i]*(x[i+1]-x[i])%mod
    lx %= mod
for i in range(m-1):
    ly += lm[i]*(y[i+1]-y[i])%mod
    ly %= mod
ans = lx*ly%mod
print(ans)
"""

Solution (Python):
O = input()
E = input()
while True:
    if len(O)!=0:
        print(O[0],end='')
        O = O[1:]
    if len(E)!=0:
        print(E[0],end='')
        E = E[1:]
    if len(O)==0 and len(E)==0:
        print()
        break

Solution (Python):

O = input()
E = input()


ans = ''
for i in range(len(O) - 1):
    ans += O[i]
    ans += E[i]

ans += O[len(O) - 1]
  
if len(E) == len(O): 
    ans += E[len(O) - 1]
    
print(ans)

Solution (Python):
o, e = input(), input()
for i in range(min(len(o), len(e))):
    print(o[i]+e[i], end='')
print(['', o[-1], e[-1]][len(o)-len(e)])

Solution (Python):
a = input()
b = input()
c = ""
for i in range(len(b)):
  c = c + a[i] + b[i]
if len(a)>len(b):
  c = c + a[len(a)-1]
print(c)

Solution (Python):
a = input()
b = input()

for i in range(len(b)):
    print(a[i], sep="", end="")
    print(b[i], sep="", end="")

if len(a) > len(b):
    print(a[len(a)-1])

Solution (Python):
O = input()
E = input()
ans = ""

for i in range(len(O)):
  ans += O[i]
  if i+1 <= len(E):
    ans += E[i]
  
print(ans)

Solution (Python):
[O,E]=[list(input()) for i in range(2)]
pas=["z" for i in range(len(O)+len(E))]
for i in range(len(pas)):
    if i%2==0:
        pas[i]=O[i//2]
    else:
        pas[i]=E[i//2]
print("".join(pas))

Solution (Python):
O = str(input())
E = str(input())

ans = ""
if len(O) == len(E):
    for i in range(len(E)):
        ans += O[i]
        ans += E[i]
else:
    for i in range(len(E)):
        ans += O[i]
        ans += E[i]
    ans += O[len(O)-1]
print(ans)

Solution (Python):
l1 = list(input())
l2 = list(input())
ans = []
for i in range(len(l1)):
    try:
        ans.append(l1[i])
        ans.append(l2[i])
    except:
        a = 0
print("".join(ans))

Solution (Python):
o=list(input())
e=list(input())+[""]
for x,y in zip(o,e):print(x+y,end="")

Solution (Python):
O = str(input())
E = str(input())

result = ''
for i in range(len(O)):
    result += O[i]
    try:
        result += E[i]
    except IndexError:
        break
print(result)

Solution (Python):
O = input()
E = input()
s = ''
for o, e in zip(O, E):
    s += o+e
print(s if len(O) == len(E) else s + O[-1])

Solution (Python):

O =str(input())
E =str(input())
ans=""
for i,o in enumerate(O):
    ans+=o
    try:
        ans+=E[i]
    except:
        pass
print(ans)

Solution (Python):
O = input()
E = input()
s = ''
for o, e in zip(O, E):
    s += o + e
print(s if len(O) == len(E) else s + O[-1])

Solution (Python):
O=list(input())
E=list(input())
ans=[]
for i in range(len(O)):
  ans.append(O[i])
  if i<len(E):
    ans.append(E[i])
print(''.join(ans))

Solution (Python):
o = input()
e = input()
a = ''
for i in range(len(e)):
    a += o[i] + e[i]
if len(o) > len(e):
    a += o[-1]
print(a)

Solution (Python):
O = list(input())
E = list(input())
ans = ''

for i in range(max(len(O), len(E))):
    if len(O) > 0:
        ans += O.pop(0)
    if len(E) > 0:
        ans += E.pop(0)
print(ans)

Solution (Python):
a,b,s=input(),input(),""
for i in range(len(a)-1):s+=a[i]+b[i]
if len(a)!=len(b):s+=a[-1]
else:s+=a[-1]+b[-1]
print(s)

Solution (Python):
O = input()
E = input()
ans = ""
for i in range(len(O)):
  ans += O[i]
  if(i < len(E)):
    ans += E[i]
print(ans)

Solution (Python):
O = input()
E = input()

ans = ""
for i in range(len(O)):
    ans += O[i]
    if i<=len(E)-1:
        ans += E[i]
print(ans)

Solution (Python):
o = input()
e = input()

res = ""
for i in range(len(o)):
    res += o[i]
    if i < len(e):
        res += e[i]

print(res)

Solution (Python):
a = list(input())
b = list(input())

c = []
cnt = 0
while cnt < len(a):
    c.append(a[cnt])
    if cnt < len(b):
        c.append(b[cnt])
    cnt += 1

print(''.join(c))

Solution (Python):
odd = input()
even = input()

ans = ''

n = len(odd) + len(even)

for i in range(n):
    ans += odd[i]
    
    if len(ans) == n:
        break
    
    ans += even[i]
    
    if len(ans) == n:
        break
    
print(ans)

Solution (Python):
o=list(input())
e=list(input())
l=[]
if len(o)==len(e):
    for i in range(len(o)):
        l.append(o[i])
        l.append(e[i])
    print("".join(l))
else:
    for i in range(len(e)):
        l.append(o[i])
        l.append(e[i])
    l.append(o[len(o)-1])
    print("".join(l))

Solution (Python):
lo=list(input())
le=list(input())
l=""
for i in range(len(le)):
  l+=lo[i]
  l+=le[i]
if len(le)==len(lo):
  print(l)
else:
  print(l+lo[-1])

Solution (Python):
O = [i for i in input()]
E = [i for i in input()]
ans=[]
for (o,e) in zip(O,E):
    ans.append(o)
    ans.append(e)
if len(O)==len(E):
    print("".join(ans))
else:
    if len(O)>len(E):
        print("".join(ans)+O[-1])
    else:
        print("".join(ans)+E[-1])

Solution (Python):
O = input()
E = input()

ans = ''

for i in range(len(E)):
    ans += O[i]
    ans += E[i]

if (len(O) != len(E)):
    ans += O[-1]

print(ans)

Solution (Python):
O = input()
E = input()
ans = ''
for o, e in zip(O, E):
    ans += o + e
print(ans if len(O) == len(E) else ans + O[-1])

Solution (Python):
O = input()
E = input()
S = ''
for i in range(len(E)):
    S += O[i] + E[i]
print(S if len(O) == len(E) else S+O[-1])

Solution (Python):
o=input()
e=input()
j,k,res=0,0,""
for i in range(len(o)+len(e)):
  if i %2:
    res+=e[k]
    k+=1
  else:
    res+=o[j]
    j+=1
print(res)

Solution (Python):
def main():
    O = input()
    E = input()
    ans = ""
    for i in range(len(O)):
        ans += O[i]
        try:
            ans += E[i]
        except IndexError:
            pass
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
O = input()
E = input()
s = ''
for a in zip(O,E):s += a[0]+a[1]
if len(O) != len(E):s += O[-1]
print(s)

Solution (Python):
from itertools import zip_longest
O=list(input())
E=list(input())
ans=''
for o,e in zip_longest(O,E):
  if bool(o): ans += o
  if bool(e): ans += e
print(ans)

Solution (Python):
a = input()
b = input()
if len(a) == len(b):
  print("".join([x+y for (x,y) in zip(a, b)]))
else:
  print("".join([x+y for (x,y) in zip(a, b)]) + a[-1])

Solution (Python):
o=list(input())
e=list(input())
z=""
for i in range(len(e)):
  z+=o[i]
  z+=e[i]
if len(e)!=len(o):
  z+=o[len(o)-1]
print(z)

Solution (Python):
o=input()
e=input()

print("".join(i+j for i, j in zip(o, e)) if len(o) ==len(e) else "".join(i+j for i, j in zip(o,e))+o[-1])

Solution (Python):
o = raw_input()
e = raw_input()
s = ""
l = len(o)
if len(e)>l:
	l = len(e)
for i in range(l):
	if i<len(o):
		s = s+o[i]
	if i<len(e):
		s = s+e[i]
print s

Solution (Python):
print((lambda a, b: ''.join([k for i in zip(a, b) for j in i for k in j]) + (a[-1] if len(a) != len(b) else ''))(input(), input()))

Solution (Python):
O = input()
E = input()
length =  len(O) + len(E)
strings = ""
for i in range(length//2):
    strings += O[i]
    strings += E[i]
if len(O) > len(E):
    strings += O[-1]
print(strings)

Solution (Python):
O=input()
E=input()
ans=''
for i in range(1,1+len(O)+len(E)):
    if i%2==1:
        ans+=O[i//2]
    else:
        ans+=E[(i-1)//2]
print(ans)

Solution (Python):
o=input()
e=input()
a=""
for i in range(len(e)):
    a+=o[i]
    a+=e[i]
if len(e)!=len(o):
    a+=o[-1]
print(a)

Solution (Python):
o=input()
e=input()
s=''
for i in range(len(e)):
  s+=o[i]+e[i]
print(s if len(o)==len(e) else s+o[-1])

Solution (Python):
o = input()
e = input()
s = ''
for i, p in zip(o,e):
    s += i+p
print(s + o[-1] if len(o) > len(e) else s)

Solution (Python):
O = input()
E = input()

ans = ""
for o, e in zip(O, E):
    ans += o + e
if len(O) != len(E):
    ans += O[-1]

print(ans)

Solution (Python):
O = str(input())
E = str(input())
tmp = 0
pas = ""
for i in range(0,len(O)+len(E),1):
  if i%2 == 0:
    pas += O[tmp]
  else:
    pas += E[tmp]
  if i%2 == 1:
    tmp += 1
print(pas)

Solution (Python):
import itertools
o = input()
e = input()
res = ''
for os,es in itertools.zip_longest(o,e):
    if os is not None:
        res += os
    if es is not None:
        res += es
print(res)