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 = list(input())
E = list(input())
ans = []

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

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

K = len(E)

String = ""

for i in range(K):
    
    String += O[i]
    String += E[i]

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

print(String)

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

Solution (Python):
print("".join([o+e for o, e in zip(input(), list(input())+[""])]))

Solution (Python):
o = input()
e = input()
k = []

for i in range(len(e)):
    k.append(o[i])
    k.append(e[i])

if len(o) > len(e):
    k.append(o[-1])

print(''.join(k))

Solution (Python):
import math
from collections import deque
from collections import defaultdict
import itertools as it


def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def combmod(n,r,mod):
	return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
	r=copyQueue(q)
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): 
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): 
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} 
def bitArr(n):
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): 
			k = i-a*j
			if k%b==0:
				return i
	return -1
def copyQueue(q):
	nq = queue.Queue()
	n = q.qsize()
	for i in range(n):
		x = q.get()
		q.put(x)
		nq.put(x)
	return nq
def get_sieve_of_eratosthenes(n):
	
	data = [0,0,0]
	for i in range(3,n+1,2):
		data.append(i)
		data.append(0)
	for i in range(len(data)):
		interval = data[i]
		if interval!=0:
			for j in range(i+interval,n-1,interval):
				data[j] = 0
	
	ans = data[:]
	return ans

o = readChar()
e = readChar()

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):
O=input()
E=input()
for i in range(0,len(E)):
  print(O[i],end="")
  print(E[i],end="")
if len(O)!=len(E):
  print(O[-1],end="")

Solution (Python):
o=input()
e=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 = list(input())
e = list(input()) + [""]
for x,y in zip(o,e):print(x+y,end='')

Solution (Python):
s1=list(input())
s2=list(input())

if len(s1)>len(s2):
    s2+=" "

s=[s1,s2]
sT=[list(x) for x in zip(*s)]

for i in range(len(s1)):
    print(sT[i][0],end="")
    print(sT[i][1],end="")

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

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

print(''.join(a + b for a, b in zip(O, E)))

Solution (Python):
from itertools import zip_longest

o = input()
e = input()
s = ''
for i, j in zip_longest(o, e, fillvalue=''):
    s = s+i+j
print(s)

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

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

Solution (Python):
s=list(input())
t=list(input())
l=[]
for i in range(len(s)-1):
    l.append(s[i])
    l.append(t[i])
if len(s)>len(t):
    l.append(s[len(s)-1])
else:
    l.append(s[len(s)-1])
    l.append(t[len(t)-1])

x=''.join(l)
print(x)

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

Solution (Python):
o=list(input())
e=list(input())
if len(o)!=len(e):
  e.append("")
ret=""
for (x,y)in zip(o,e):
  ret+=x+y

print(ret)

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

Solution (Python):
o = str(input())
e = str(input())
s = []
for i in range(len(e)):
    s.append(o[i])
    s.append(e[i])
if len(o) > len(e):
    s.append(o[-1])
print(*s, sep = "")

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

for s, t in zip(o, e):
  print(s, t, sep='', end='')

Solution (Python):
def joinstring(O, E) : 
  if len(O) - len(E) > 0 : 
    str = "".join([i + j for i, j in zip(O, E)])
    str += O[-1]
    return str
  else : 
    str = "".join([i + j for i, j in zip(O, E)])
  return str


O = input()
E = input()

print(joinstring(O, E))

Solution (Python):
o = input()
e = input()
s = ''.join([o[i//2] if i % 2 == 0 else e[i//2] for i in range(len(o)+len(e))])
print(s)

Solution (Python):
a=input()
b=input()
x=''
for i in range(len(b)):
  x+=a[i]
  x+=b[i]
if len(a)==len(b):
  print(x)
else:
  print(x+a[-1])

Solution (Python):

O = input()
E = input()
result = [""] * (len(O) + len(E))
for i in range(len(O)):
    result[2 * i] = O[i]
for i in range(len(E)):
    result[2 * i + 1] = E[i]
print("".join(result))

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

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

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

l = min(len(O), len(E))
s = ""
for i in range(l):
  s = s + O[i] + E[i]

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

print(s)

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

L = []
for i in range(len(O)):
  L.append(O[i])
  L.append("")

for j in range(len(E)):
  L[2*j+1] = E[j]

l = ""
for i in range(len(L)):
  l = l + L[i]

print(l)

Solution (Python):
import itertools as it
print("".join(it.chain.from_iterable(it.zip_longest(*[input() for _ in range(2)],fillvalue=""))))

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

res = ''
for i in range(len(O)):
    if i >= len(E):
        res += O[i]
    else:
        res += O[i] + E[i]

print(res)

Solution (Python):
O = input()
E = input()
l = min(len(O),len(E))
s = ""
for i in range(l):
  s = s+O[i]+E[i]
  
if s[2*(l-1)] == O[len(O)-1]:
  print(s)
else:
  print(s+O[len(O)-1])

Solution (Python):
o=input()
e=input()
a=''
for i in range(len(o)+len(e)):
	if i%2==0:
		a+=o[int(i/2)]
	else:
		a+=e[int((i-1)/2)]
print(a)

Solution (Python):
import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))

o = S()
e = S()
for i in range(len(o)+len(e)):
    if i%2 == 0:
        print(o[i//2],end = "")
    else:
        print(e[i//2],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[len(o)-1]
print(ans)

Solution (Python):
o = input()
e = input()
s = ""
for a in range(max(len(o), len(e))):
    try:
        s += o[a]
    except IndexError:
        pass
    try:
        s += e[a]
    except IndexError:
        pass
print(s)

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[len(O)-1]

print(ans)

Solution (Python):
O = str(input())
E = str(input())
E = E + " "
ans = ""
i = 0

while i<len(O):
  ans = ans + O[i] + E[i]
  i = i + 1

print(ans.rstrip(" "))

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()

password = []
for i in range(len(O)):
    password += [O[i]]
    if i == len(O) - 1:
        if i != len(E):
            password += [E[i]]
    else:
        password += [E[i]]
print(''.join(password))

Solution (Python):
O = input()


E = input()

S = []

if len(O) == len(E):
	for i in range(len(O)):
		S.append(O[i] + E[i])
else:
	for i in range(len(E)):
		S.append(O[i] + E[i])
	S.append(O[-1])

print("".join(S))

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

pw = [""] * (len(o)+len(e))

for i in range(len(o)):
  pw[2*i] = o[i]
for i in range(len(e)):
  pw[2*i+1] = e[i]
print("".join(pw))

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

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

ans = ''

for a in range(length):
    ans += o[a]
    if a < len(e):
        ans += e[a]

print(ans)

Solution (Python):
o = input()
e = input()
flag = False
if len(o) == len(e):
    length = len(o)
else:
    flag = True
    length = len(e)

ans = ''

for a in range(length):
    ans += o[a]
    ans += e[a]

if flag:
    print(ans + o[-1])
else:
    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[len(O)-1]

print(ans,end='')

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[len(o)-1]
print(ans)

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

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

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

Solution (Python):
from collections import deque
O = deque(list(input()))
E = deque(list(input()))
Ans = []

for i in range(len(O) + len(E)):
    if i % 2 == 0:
        Ans.append(O.popleft())
    else:
        Ans.append(E.popleft())

print(''.join(Ans))

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

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

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

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

Solution (Python):
o = input()
e = input()
string = len(o) + len(e)
result = ''
c = 0
for i in range(string):
    try:
        result += o[i]
    except:
        pass
    try:
        result += e[i]
    except:
        pass
print(result)

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

Solution (Python):
s = input()
t = input()
n = len(t)
for i in range(n):
  print(s[i], end="")
  print(t[i], end="")
if len(s) != len(t):
  print(s[-1], end="")
print()

Solution (Python):
o = input()
e = input()
lo = len(o)
le = len(e)

if lo == le: l = lo
elif lo >= le: l = le
else: l = lo

s = ""
for i in range(l):
        s += o[i]
        s += e[i]
if lo - le == 1:
    s += o[-1]
print(s)

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

pw = []

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

print("".join(pw))

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

    length = len(o) + len(e)

    ans = str()
    oe = int()
    for i in range(1, length + 1):
        if i % 2 == 0:
            oe = int(i / 2) - 1
            ans += e[oe]
        if i % 2 == 1:
            oe = int((i-1) / 2)
            ans += o[oe]
    print(ans)
resolve()

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

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

Solution (Python):

O = input()
E = input()

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

Solution (Python):
O = input()
E = input() + " "
print("".join(o + e for o, e in zip(O, E)).strip())

Solution (Python):
sa = input()
sb = input()
for ca, cb in zip(sa, sb):
	print(ca, cb, sep='', end='')
if len(sa) != len(sb):
	print(sa[-1])

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    o = input()
    e = input()

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


if __name__ == "__main__":
    main()

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):
A = input()
B = input()
ans = ''
if len(A) == len(B):
    for i in range(len(A)):
        ans += A[i] + B[i]
else:
    for i in range(len(B)):
        ans += A[i] + B[i]
    ans += A[-1]

print(ans)

Solution (Python):
A=list(input())
B=list(input())
C=list()
if len(A)==len(B):
  for i in range(len(A)):
    C.append(A[i]+B[i])
  print(''.join(C))
else:
  for i in range(len(B)):
    C.append(A[i]+B[i])
  C.append(A[-1])
  print(''.join(C))

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

for i in range(len(O)+len(E)):
	if i%2==0:
		a.append(O[int(i/2)])
	else:
		a.append(E[int((i-1)/2)])
print(''.join(a))

Solution (Python):
O = list(input())
E = list(input()) + ['']
print(*[O+E for O,E in zip(O,E)], sep='')

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

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

print(ans)

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

for i in range(0,max(len(o),len(e))):
  
  if(len(o) != 0 and len(e) != 0):
    x.append(o[0])
    del o[0]
    x.append(e[0])
    del e[0]
  elif(len(o) != 0 and len(e) == 0):
    x.append(o[0])
    del o[0]
  elif(len(o) == 0 and len(e) != 0):
    x.append(e[0])
    del e[0]
print(''.join(x))

Solution (Python):

import sys

import fractions
import copy
import bisect
import math
import numpy as np
import itertools
from itertools import combinations_with_replacement


from operator import itemgetter
from sys import stdin

from operator import mul
from functools import reduce
from collections import Counter





j=0
k=0
n=3
r=1
a=[0]






"1行1つの整数を入力を取得し、整数と取得する"




"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

for i in number_list:
    print(number_list[i-1])

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''



"正方行列にstr型の値を入力"
'''




'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"


'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''











'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''




"aという変数に入っているものを大文字にして出力"

















'''
コンビネーションの組み合わせの中身を出力する形式
for i in itertools.combinations(brray, 2)
combinationsをpermutationsにすれば順列になる
今回なら(abc133B)
入力
1 2
5 5
-2 8
出力
[[1, 2], [5, 5], [-2, 8]]
もちろん一次元リストでも使えるし
何よりiもリストのように使えるので便利
'''


'''
def cmb(n,r):
    
    r= min(n-r,r)
    
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    
    
    

    under = reduce(mul, range(1, r+1))
    
    
    
    

    return over // under
    
    
    
    
a = cmb(n, r)

'''

'''
import itertools
from itertools import combinations_with_replacement

combinationについて
以下の違いを意識しよう
combinations() p, r 長さrのタプル列、ソートされた順で重複なし

combinations_with_replacement() p, r 長さrのタプル列、ソートされた順で重複あり


使用例 　　　　　　　　　　　                  出力　　
combinations('ABCD', 2)　　　　　　　　　　　　AB AC AD BC BD CD

combinations_with_replacement('ABCD', 2)　　 AA AB AC AD BB BC BD CC CD DD
'''



'''




for i in a.most_common(n):print(i)





 


'''









'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

'''
素数の判定
'''


def is_prime(n):
    if n == 1: return False

    for k in range(2, int(np.sqrt(n)) + 1):
        
        if n % k == 0:
            return False
            
    return True


'''
npのmaxとmaximumの違い
xs = np.array([1, -2, 3])
np.max(xs, 0)
この出力は3となります．[1, -2, 3]と0の4つの数字のうち，最も大きい値を出力します．

一方で，[max(1, 0), max(-2, 0), max(3, 0)]を出力したい時があります．
その時は，numpyのmaximum関数を用います．

xs = np.array([1, -2, 3])
np.maximum(xs, 0)  

'''

def factorial(x, mod=10**9+7):
    
    
    
    tmp = 1
    for i in range(1, x+1):
        tmp = (tmp * i) % mod
    return tmp
    '''
    Basically, when you do a**d % n, you actually have to calculate a**d, which could be quite large.
    But there are ways of computing a**d % n without having to compute a**d itself, and that is what pow does.
    '''











'''
ascii_letters = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
digits = '0123456789'
hexdigits = '0123456789abcdefABCDEF'
letters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuv...\xaf\xb0...
lowercase = 'abcdefghijklmnopqrstuvwxyz'
octdigits = '01234567'
printable = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTU...
punctuation = '!"
uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
whitespace = '\t\n\x0b\x0c\r '
'''
'''
引数endに任意の文字列を指定すると、その文字列が改行の代わりに最後に挿入される。例えば連続するprint()の出力を改行なしで単純に連結したい場合は空文字列''を指定すればよい。

print('abc', end='---')
print('xyz')


print('abc', end='')
print('xyz')

source: print_basic.py
なお、デフォルトで改行されるのは引数endのデフォルト値が改行文字'\n'に設定されているから。
'''

def main():
    n=3
    steps=0
    state=0
    w=1
    j=0
    k=0
    
    
    
    
    
    s=input()
    odd=[i for i in s]
    p=input()
    even=[i for i in p]
    
    n=len(odd)
    
    
    ss=["a"]*n
    

    if len(odd)==len(even):
     for i in range(n):
        
        ss[i]=odd[i]+even[i]
    
    else:
     for i in range(n-1):
        
        ss[i]=odd[i]+even[i]
     ss[n-1]=(odd[-1])
    print("".join(ss))
    
    
    
    


    for i in range(1,n+1,2):
     pass
     

    l = ['aaa', 'bbb', 'ccc']
    x=l.index('aaa')
    
    
    
    

    
        
    
    

    
    
    
    
    DP = np.zeros(w+1, dtype=int)
    exdp=np.zeros((3,4)) 
    
    
    
        
        
    
    
        
        
    


    
    



    '''
    入力
    1234
    出力
    [1, 2, 3, 4]
    '''
    pin_l=["x" for i in range(10)]
    

    ls = ["a", "b", "c", "d", "e"]


    
    

    
    

    
    
    
    
    
    '''
    lsというリストの場合に、1つ飛びの値を取得したい場合には
    ls[::2]
    のようにします。こうすると、
    ["a", "c", "d"]と出力される
    '''

if __name__ == "__main__":
    main()

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

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

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

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

print(ans)

Solution (Python):
def f07():
    O=input()
    E=input() + ' '
    for o, e in zip(O, E):
        print(o+e, end='')
f07()

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

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

odd_count = 0
even_count = 0
result = ''

for i in range(1, len(o)+len(e)+1):
    if i % 2 == 0:
        result += e[even_count]
        even_count += 1
    else:
        result += o[odd_count]
        odd_count += 1
print(result)

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

ans = ''

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

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

print(ans)

Solution (Python):
from itertools import zip_longest

O = input()
E = input()

if len(O) == len(E):
    print("".join([o + e for o, e in zip_longest(O, E)]))
else:
    print("".join([o + e for o, e in zip_longest(O[:-1], E)]) + O[-1])

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

ans = ""
O = [o for o in O]
E = [e for e in E]

for i in range(len(O) + len(E)):
    if i % 2 == 0:
        ans += O.pop(0)
    else:
        ans += E.pop(0)

print(ans)

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

Solution (Python):
o = input()
e = input()
ans = [0] * (len(o) + len(e))
ans[::2] = o
ans[1::2] = e
print(''.join(ans))

Solution (Python):
from collections import deque
O = deque(list(input()))
E = deque(list(input()))
ans = []
while O:
    ans.append(O.popleft())
    if E:
        ans.append(E.popleft())
print("".join(ans))

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

for x, y in zip(o, e):
    print(x + y, end = '')
if len(o) != len(e):
    print(o[-1])
else:
    print()

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

for i in range(min(len(o), len(e))):
    print(o[i], end="")
    print(e[i], end="")

if len(o) > len(e):
    print(o[-1])
elif len(o) < len(e):
    print(e[-1])

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

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

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

print(res)

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

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()

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 = input()
E = input()

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

print(*ans,sep="")

Solution (Python):

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

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

res = [None for _ in range(len(O) + len(E))]

for i in range(len(res)):
    if i % 2 == 0:
        res[i] = O[i//2]
    else:
        res[i] = E[i//2]

print(''.join(res))

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    O=input()
    E=input()+' '
    for a,b in zip(O,E):
        print(a+b,sep='',end='')
    print('')

if __name__ == '__main__':
    main()

Solution (Python):
o = input()
o_len = len(o)
e = input()
e_len = len(e)
ans = ""
flag1 = "on"
flag2 = "on"
for i in range(1,101):
    if o_len >= i:
        ans = ans + o[i-1]
    else:
        flag1 = "off"
    if e_len >= i:
        ans = ans + e[i-1]
    else:
        flag2 = "off"

    if flag1 == "off" and flag2 == "off":
        break
print(ans)

Solution (Python):
O = input()
E = input()
password = ''
for o, e in zip(O, E):
  password += o + e

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

print(password)

Solution (Python):
def func(o, e):
  pwd = ""
  if len(o) == len(e):
    for i in range(len(o)):
      pwd += o[i] + e[i]
  else:
    for i in range(len(e)):
      pwd += o[i] + e[i]
    pwd += o[len(o)-1]
  print(pwd)

o = input()
e = input()

func(o, e)

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 = list(input())
E = list(input())
S = ""
for i in range(len(O)):
    S += O[i]
    if i < len(E):
        S += E[i]
print(S)

Solution (Python):
a=input()
b=input()
ans=""
for i in range(len(a)):
    if len(b)==i:
        ans+=a[i]
        break
    ans+=a[i]+b[i]
print(ans)

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

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

if len(O)==len(E):
    for a,b in zip(O,E):
        print(a+b, end="")
else:
    for i in range(len(E)):
        print(O[i]+E[i], end="")
    print(O[-1],end="")

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

length = len(o) if len(o) > len(e) else len(e)
ans = ''
for i in range(length):
    try:
        ans += o[i]
        ans += e[i]
    except IndexError:
        pass
print(ans)

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=list(str(input()))
E=list(str(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))

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

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

Solution (Python):
o = list(input())
s = list(input()) + ['']
print(*[o + s for o, s in zip(o, s)], sep='')

Solution (Python):
o = input()
e = 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))

Solution (Python):
o = input()
e = input()
ans = []

for i in range(len(o) - 1):
    ans.append(o[i])
    ans.append(e[i])

ans.append(o[-1])

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

print("".join(ans))

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

for i in range(len(o) - 1):
    ans.append(o[i])
    ans.append(e[i])

ans.append(o[-1])

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

print("".join(ans))

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

p = []

for i in range(len(o + e)):
    if i % 2 == 0:
        p.append(o.pop(0))
    else:
        p.append(e.pop(0))

print(''.join(map(str, p)))

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

ans = []
cnt = 0

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))

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

for i in range(len(o)):
    print(o[i], end="")
    if i < len(e):
        print(e[i],end="")

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

olen = len(o)
elen = len(e)

res = ""

if olen == elen:
    for i in range(olen):
        res += o[i]
        res += e[i]
    print(res)

else:
    for i in range(elen):
        res += o[i]
        res += e[i]
    res += o[elen]
    print(res)

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

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


if __name__ == "__main__":
    main()