AtCoder Beginner Contest 058 - ∵∴∵

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-----
xyz
abc

-----Sample Output-----
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.

Source: atcoder | Difficulty: EASY


Solutions:
print(*(x + y for (x, y) in zip(input(), input() + ' ')), sep='')


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)


import sys
input = sys.stdin.readline

def main():
	O = input().rstrip()
	E = input().rstrip()
	password = ''
	last = ''
	if len(O) > len(E):
		last = O[-1]
	elif len(O) < len(E):
		last = E[-1]
	else:
		last = ''
	for (p1, p2) in zip(O, E):
		password += p1 + p2
	print(password + last)

def __starting_point():
	main()
__starting_point()


from itertools import zip_longest
print(''.join(sum(zip_longest(input(), input(), fillvalue=''), tuple())))


O = input()
E = input()
print(''.join((i + j for (i, j) in zip(O, E + ' '))).strip())


def actual(O, E):
	s = ''.join([f'{o}{e}' for (o, e) in zip(O, E)])
	if len(O) - len(E) == 1:
		s += O[-1]
	return s
O = input()
E = input()
print(actual(O, E))


o = list(input())
e = list(input())
oc = 0
ec = 0
ans = ''
n = len(o) + len(e)
for i in range(1, n + 1):
	if i % 2 == 0:
		add = e[ec]
		ec += 1
	else:
		add = o[oc]
		oc += 1
	ans += add
print(ans)


O = list(input())
E = list(input()) + ['']
print(*[o + e for (o, e) in zip(O, E)], sep='')


odd = list(input())
even = list(input()) + ['']
for (x, y) in zip(odd, even):
	print(x + y, end='')


o = input()
e = input() + ' '
x = ''
for i in range(len(o)):
	x = x + o[i] + e[i]
print(x)


A = input()
B = input()
pw = ''
if len(A) == len(B):
	for i in range(len(A)):
		pw += A[i]
		pw += B[i]
	print(pw)
	return
else:
	for i in range(len(B)):
		pw += A[i]
		pw += B[i]
	print(pw + A[-1])
	return


a = input()
b = input()
s = ''
for i in range(len(b)):
	s += a[i] + b[i]
if len(a) > len(b):
	s += a[-1]
print(s)


import sys, math
from itertools import combinations as c, product as p
from collections import deque
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

def si():
	return input()

def ii():
	return int(input())

def fi():
	return float(input())

def lstr():
	return input().split()

def lint():
	return list(map(int, input().split()))

def lintdec():
	return list(map(lambda x: int(x) - 1, input().split()))

def lnstr(n):
	return [input() for _ in range(n)]

def lnint(n):
	return [int(input()) for _ in range(n)]

def lint_list(n):
	return [lint() for _ in range(n)]
O = si()
E = si()
for i in range(len(O + E)):
	if i % 2:
		print(E[i // 2], end='')
	else:
		print(O[i // 2], end='')
print()


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


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


O = input()
E = input()
ans = ''
for (x, y) in zip(list(O), list(E) + ['']):
	ans += x + y
print(ans)


o = input()
e = input() + '0'
ans = ''
for i in range(len(o)):
	ans += o[i]
	if e[i] != '0':
		ans += e[i]
print(ans)


a = input()
b = input()
li = []
if len(a) == len(b):
	for i in range(len(a)):
		li.append(a[i] + b[i])
else:
	for i in range(len(b)):
		li.append(a[i] + b[i])
	li.append(a[-1])
print(''.join(li))


o = input()
e = input() + ' '
for (a, b) in zip(o, e):
	print(a + b, end='')


o = input()
e = input()
oe = ''.join([i + j for (i, j) in zip(o, e + '\n')])
print(oe)


O = input()
E = input()
ans = ''
while len(O) > 0:
	ans += O[:1] + E[:1]
	O = O[1:]
	E = E[1:]
print(ans)


O = list(input())
E = list(input()) + ['']
for (x, y) in zip(O, E):
	print(x, y, sep='', end='')


o = input() + ' '
e = input() + ' '
ans = ''
for (i, j) in zip(o, e):
	ans += i
	ans += j
print(ans)


(o, e) = [input() for i in range(2)]
for i in range(len(e)):
	print(o[i], end='')
	print(e[i], end='')
if len(o) - len(e) == 1:
	print(o[len(o) - 1])


o = str(input())
e = str(input())
a = ''
for i in range(len(e)):
	a += o[i]
	a += e[i]
	if len(o) != len(e) and i == len(e) - 1:
		a += o[i + 1]
print(a)


j = ''.join
print(j(map(j, zip(*open(0)))))


a = list(input())
b = list(input())
A = ['' for i in range(len(a) + len(b))]
A[::2] = a
A[1::2] = b
print(''.join(A))


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


a = list(input())
b = list(input()) + ['']
for (x, y) in zip(a, b):
	print(x + y, end='')


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)


O = list(input())
E = list(input())
res = []
if len(O) - len(E) == 0:
	for (i, j) in zip(O, E):
		res.append(i)
		res.append(j)
else:
	E.append('')
	for (i, j) in zip(O, E):
		res.append(i)
		res.append(j)
	res.pop(-1)
pw = ''.join(res)
print(pw)


o = list(input())
e = input()
for i in range(len(e)):
	o.insert(i * 2 + 1, e[i])
print(''.join(o))


o = input()
e = input()
a = ''
for i in range(len(o)):
	a += o[i]
	if i < len(e):
		a += e[i]
print(a)


o = input()
e = input()
print(*(e[i // 2] if i % 2 else o[i // 2] for i in range(len(o + e))), sep='')


o = input()
e = input()
r = ''
for i in range(len(e)):
	r += o[i] + e[i]
if len(o) != len(e):
	r += o[-1]
print(r)


o = input()
e = input() + ' '
s = ''
for i in range(len(o)):
	s += o[i] + e[i]
print(s)


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)


A = input()
B = input()
S = list(A)
for i in range(len(B)):
	S.insert(i * 2 + 1, B[i])
print(''.join(map(str, S)))


o = input()
e = input()
n = len(o)
m = len(e)
ans = []
for i in range(m):
	ans.append(o[i])
	ans.append(e[i])
if n - m == 0:
	print(*ans, sep='')
else:
	ans.append(o[n - 1])
	print(*ans, sep='')


print(''.join([a + b for (a, b) in zip(input(), input() + '\n')]).split('\n')[0])


o = str(input())
e = str(input())
print(''.join((i + j for (i, j) in zip(o, e + ' '))).rstrip())


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


I = input
for (i, j) in zip(I(), I() + ' '):
	print(i + j, end='')


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


o = input()
e = input() + ' '
s = []
for (i, j) in zip(o, e):
	print(i + j, end='')


a = input()
b = input()
if len(a) > len(b):
	b += ' '
r = ''
for i in range(len(a)):
	r += a[i] + b[i]
print(r)


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


O = input()
E = input()
l = [0] * (len(O) + len(E))
l[0::2] = list(O)
l[1::2] = list(E)
print(''.join(l))


o = list(input())
e = list(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)


(o, e) = (input(), input() + ' ')
print(''.join(map(''.join, zip(o, e))))


def answer(o: str, e: str) -> str:
	result = ''
	e += ' '
	for i in range(len(o)):
		result += o[i] + e[i]
	return result.strip()

def main():
	o = input()
	e = input()
	print(answer(o, e))

def __starting_point():
	main()
__starting_point()


s = input()
r = input()
t = ''
for i in range(len(r)):
	t += s[i] + r[i]
if len(s) > len(r):
	t += s[-1]
print(t)


O = input()
E = input()
if len(O) - len(E) > 0:
	E += ' '
for (a, b) in zip(O, E):
	print(a + b.strip(), end='')


o = list(input())
e = list(input()) + ['']
for (s, t) in zip(o, e):
	print(s, t, sep='', end='')


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


o = input()
e = input()
p = ''
for i in range(len(o)):
	p += o[i]
	if i < len(e):
		p += e[i]
print(p)


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


o = input()
e = input()
t = ''
for (a, i) in enumerate(o):
	t += i
	if a + 1 <= len(e):
		t += e[a]
print(t)


O = input()
E = input()
o = len(O)
e = len(E)
[print(O[i], E[i], sep='', end='') for i in range(min(o, e))]
print('' if o == e else O[-1])


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


o = input()
e = input() + ' '
print(*[o + e for (o, e) in zip(o, e)], sep='')


O = input()
E = input()
l = len(O) + len(E)
o = ''
for i in range(l):
	o += [O, E][i % 2][i // 2]
print(o)


o = input()
e = input()
O = len(o)
E = len(e)
a = []
if O == E:
	for i in range(O):
		a.append(o[i] + e[i])
	b = ''.join(a)
	print(b)
else:
	for i in range(E):
		a.append(o[i] + e[i])
	a.append(o[O - 1])
	b = ''.join(a)
	print(b)


O = list(input())
E = list(input())
i = 1
for x in E:
	O.insert(i, x)
	i += 2
print(''.join(O))


(O, E) = (input(), list(input()) + [''])
s = [i + j for (i, j) in zip(O, E)]
print(*s, sep='')


o = list(input())
e = list(input())
for i in range(len(e)):
	o[i] += e[i]
print(''.join(o))


a = input()
b = input()
print(''.join(map(''.join, zip(a, b))) + (a[-1] if len(a) is not len(b) else ''))


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)


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


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


O = input()
E = input() + ' '
print(''.join([o + e.strip() for (o, e) in zip(O, E)]))


o = input()
e = input()
print(''.join([a + b for (a, b) in zip(o, e)]) + o[-1] * (len(o + e) % 2))


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


O = input()
E = input()
E += ' '
s = ''
for i in range(len(O)):
	s += O[i] + E[i]
s.split()
print(s)


o = list(input())
e = list(input()) + ['']
for i in range(len(o)):
	print(o[i] + e[i], end='')


a = input()
b = input()
r = ''
for (i, j) in zip(a, b):
	r += i + j
print(r if len(a) == len(b) else r + a[-1])


A = list(input())
B = list(input())
L = ['0'] * (len(A) + len(B))
L[::2] = A
L[1::2] = B
print(''.join(L))


x = list(input())
y = list(input()) + ['']
for i in range(len(x)):
	print(x[i] + y[i], end='')


a = input()
b = input()
x = ''
while len(a) > 0:
	x += a[:1]
	a = a[1:]
	x += b[:1]
	b = b[1:]
print(x)


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


O = input()
E = input() + ' '
print(*[a + b for (a, b) in zip(O, E)], sep='')


def main():
	O = list(input())
	E = list(input())
	O.reverse()
	E.reverse()
	ans = ''
	for _ in range(200):
		ans += O.pop()
		if len(E) == 0:
			break
		ans += E.pop()
		if len(O) == 0:
			break
	print(ans)

def __starting_point():
	main()
__starting_point()


O = list(input())
E = input()
for i in range(len(E)):
	O.insert(2 * i + 1, E[i])
print(*O, sep='')


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


print(''.join([o + e for (o, e) in zip(input(), input() + '\n')]))


o = input()
e = input()
if len(o) > len(e):
	e += ' '
print(''.join([ch1 + ch2 for (ch1, ch2) in zip(o, e)]))


odd = list(input())
even = list(input()) + ['']
r = ''
for (o, e) in zip(odd, even):
	r += o + e
print(r)


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


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


o = input()
e = input()
for (i, j) in zip(o, e):
	print(i + j, end='')
if len(o) != len(e):
	print(o[-1:])


O = input()
E = input()
ans = [None] * (len(O) + len(E))
(ans[::2], ans[1::2]) = (O, E)
print(''.join(ans))


o = input()
e = input() + ' '
print(''.join([i + j for (i, j) in zip(o, e)]))


o = list(input())
e = list(input()) + ['']
result = ''.join([x + y for (x, y) in zip(o, e)])
print(result)


o = [a for a in str(input())]
e = [b for b in 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))


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


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


O = input()
E = input()
combi = ''
for i in range(len(O) + len(E)):
	if i % 2 == 0:
		combi += O[i // 2]
	elif i % 2 != 2:
		combi += E[i // 2]
print(combi)


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


O = list(input())
E = list(input()) + ['']
for (o, e) in zip(O, E):
	print(o + e, end='')


print(''.join(map(lambda t: ''.join(t), zip(input(), input() + ' '))).strip())


O = list(input())
E = list(input())
ans = ['0'] * (len(O) + len(E))
ans[::2] = O
ans[1::2] = E
print(''.join(ans))


a = input()
b = input()
s = ''
while len(a) > 0:
	s += a[0]
	a = a[1:]
	if len(b) > 0:
		s += b[0]
		b = b[1:]
print(s)


o = list(input())
e = list(input()) + ['']
ans = [a + b for (a, b) in zip(o, e)]
print(''.join(ans))


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


o = input()
t = input()
ans = ''
for i in range(min(len(o), len(t))):
	ans += o[i] + t[i]
if len(o) > len(t):
	ans += o[-1]
elif len(o) < len(t):
	ans += t[-1]
else:
	pass
print(ans)


o = list(input())
e = list(input())
e.append('')
for (i, x) in zip(o, e):
	print(i + x, end='')


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)


print(''.join((''.join(x) for x in zip(input(), input() + ' '))).strip())


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


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


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


def main():
	o = list(input())
	d = list(input())
	for i in range(len(o) + len(d)):
		if i % 2 == 0:
			print(o.pop(0), end='')
		else:
			print(d.pop(0), end='')

def __starting_point():
	main()
__starting_point()


a = list(input())
b = list(input())
for i in range(0, len(a) + len(b)):
	if i % 2 == 0:
		print(a.pop(0), end='')
	else:
		print(b.pop(0), end='')


n = list(input())
m = list(input()) + ['']
for (x, y) in zip(n, m):
	print(x + y, end='')


def main():
	a = input()
	b = input()
	for i in range(len(a)):
		print(a[i], end='')
		if i < len(b):
			print(b[i], end='')
	print()

def __starting_point():
	main()
__starting_point()


O = input()
E = input() + ' '
P = ''
for i in range(len(O)):
	P += O[i] + E[i]
print(P.rstrip())


def main():
	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)

def __starting_point():
	main()
__starting_point()


o = input() + ' '
e = input() + ' '
x = list(map(lambda a, b: a + b, o, e))
x = ''.join(x)
print(x.strip())


O = input()
E = input()
s = ''
for (so, se) in zip(O, E):
	s += so + se
if len(list(O)) > len(list(E)):
	s += O[-1]
elif len(list(O)) < len(list(E)):
	s += E[-1]
print(*s, sep='')


j = ''.join
print(j(map(j, zip(input(), input() + ' '))))


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


O = input()
E = input()
Ans = []
if len(O) - len(E) == 0:
	for i in range(len(O)):
		Ans.append(O[i])
		Ans.append(E[i])
else:
	for i in range(len(E)):
		Ans.append(O[i])
		Ans.append(E[i])
	Ans.append(O[len(O) - 1])
print(''.join(Ans))


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


O = list(input())
E = list(input()) + ['']
for (i, j) in zip(O, E):
	print(i + j, end='')


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


o = input()
e = input()
p = ''
if len(o) == len(e):
	for i in range(0, len(o)):
		p += o[i] + e[i]
elif len(o) >= len(e):
	for i in range(0, len(e)):
		p += o[i] + e[i]
	p += o[-1]
print(p)


a = input()
b = input()
ans = ''
for (x, y) in zip(a, b):
	ans += x + y
print(ans if len(a) == len(b) else ans + a[-1])


O = str(input())
E = str(input())
S = ''
for i in range(len(O) + len(E)):
	if i % 2 == 0:
		S += O[i // 2]
	else:
		S += E[i // 2]
print(S)


o = input()
e = input()
res = ''
n = min(len(o), len(e))
for i in range(n):
	res += o[i] + e[i]
if len(e) > len(o):
	res += e[-1]
elif len(e) < len(o):
	res += o[-1]
print(res)


O = list(input())
lo = len(O)
E = list(input())
le = len(E)
w = lo + le
X = ['*'] * w
for i in range(le):
	X[2 * i] = O[i]
	X[2 * i + 1] = E[i]
if lo > le:
	X[-1] = O[-1]
print(''.join(X))


O = input()
E = input()
print(''.join([O[i] + E[i] if i < len(E) else O[i] for i in range(len(O))]))


o = input()
e = input() + ' '
print(''.join([a + b for (a, b) in zip(o, e)]).strip())


s = input()
t = input()
ans = ''
if (len(s) + len(t)) % 2 == 0:
	for i in range(len(s)):
		ans += s[i]
		ans += t[i]
else:
	for i in range(len(t)):
		ans += s[i]
		ans += t[i]
	ans += s[-1]
print(ans)


o = list(input())
e = list(input()) + ['']
ans = ''.join((o + e for (o, e) in zip(o, e)))
print(ans)


o = input()
e = input() + ' '
print(''.join(['{}{}'.format(a, b) for (a, b) in zip(o, e)]).replace(' ', ''))


o = str(input())
e = str(input())
for i in range(len(e)):
	k = 2 * i
	o = o[:k + 1] + e[i] + o[k + 1:]
print(o)


a = input()
b = input()
s = ''
for i in range(len(a) + len(b)):
	s += a[0]
	a = a[1:]
	(a, b) = (b, a)
print(s)


from collections import deque
from itertools import count
Odd = deque(input())
Even = deque(input())
rtnList = lambda x: Odd if x & 1 else Even
ans = ''
for i in count(1, 1):
	try:
		s = rtnList(i).popleft()
	except IndexError:
		print(ans)
		return
	ans += s


a = list(input())
b = list(input())
f = False
x = []
if len(a) > len(b):
	b.append(0)
	f = True
for i in range(len(a)):
	x.append(a[i])
	x.append(b[i])
if f:
	x.pop()
print(''.join(x))


o = input()
e = input()
len_o = len(o)
len_e = len(e)
ans = ''
if len_o == len_e:
	for i in range(len_o):
		ans += o[i]
		ans += e[i]
elif len_o > len_e:
	for i in range(len_e):
		ans += o[i]
		ans += e[i]
	for i in range(len_e, len_o):
		ans += o[i]
else:
	for i in range(len_o):
		ans += o[i]
		ans += e[i]
	for i in range(len_o, len_e):
		ans += e[i]
print(ans)


li_o = input()
li_e = input()
an = ''
for i in range(len(li_o)):
	an += li_o[i]
	if i != len(li_e):
		an += li_e[i]
	else:
		break
print(an)


o = input()
e = input()
if len(o) - len(e) > 0:
	e += ' '
for (a, b) in zip(o, e):
	print(a + b.strip(), end='')


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


o = input()
e = input()
print(''.join([a + b for (a, b) in zip(o, e)]) + o[len(e):])


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


s1 = input()
s2 = input()
ans = ''
for (i, j) in zip(s1, s2):
	ans += i + j
if len(s1) != len(s2):
	ans += s1[-1]
print(ans)


o = str(input())
e = str(input())
ans = ''
judge = False
if len(o) - len(e) == 1:
	judge = True
for i in range(len(e)):
	ans += o[i]
	ans += e[i]
if judge:
	ans += o[-1]
print(ans)


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


import sys
input = sys.stdin.readline
from collections import deque

def read():
	O = input().strip()
	E = input().strip()
	return (O, E)

def solve(O, E):
	ans = []
	oq = deque(O)
	eq = deque(E)
	while eq:
		ans.append(oq.popleft())
		ans.append(eq.popleft())
	if oq:
		ans.append(oq.popleft())
	return ''.join(ans)

def __starting_point():
	inputs = read()
	outputs = solve(*inputs)
	if outputs is not None:
		print('%s' % str(outputs))
__starting_point()


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


print(''.join((s + t for (s, t) in zip(input(), input() + ' '))))


o = list(input())
e = list(input())
s = ''
for (i, j) in zip(o, e):
	s += i + j
if len(o) != len(e):
	s += o[-1]
print(s)


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


o = input()
e = input()
print(''.join((x + y for (x, y) in zip(list(o), list(e)))) + ('' if len(o) == len(e) else o[-1]))


import math
a = input()
b = input()
n = ''
for i in range(len(a) + len(b)):
	if i % 2 == 0:
		n = n + a[i // 2]
	else:
		n = n + b[math.ceil(i / 2) - 1]
print(n)


print(''.join(sum(zip(input(), input() + ' '), ())))


print(''.join(map(''.join, zip(input(), input() + ' '))))


s = list(input())
t = list(input())
l = min(len(s), len(t))
if len(s) > len(t):
	x = 1
elif len(s) < len(t):
	x = 2
else:
	x = 0
for i in range(l):
	print(s[i], end='')
	print(t[i], end='')
if x == 1:
	print(s[-1])
elif x == 2:
	print(t[-1])


o = input()
e = input()
password = ''
for i in range(len(o)):
	password += o[i]
	if len(e) > i:
		password += e[i]
print(password)


O = input()
E = input()
t = ''
n = min(len(O), len(E))
for i in range(n):
	t += O[i] + E[i]
if len(O) > len(E):
	t += O[len(O) - 1]
elif len(O) < len(E):
	t += E[len(E) - 1]
print(t)


A = list(input())
B = list(input())
x = A[0] + B[0]
for i in range(1, len(B)):
	x = x + A[i] + B[i]
if len(A) > len(B):
	x = x + A[-1]
print(x)


o = list(input())
e = list(input())
lst = []
for (oo, ee) in zip(o, e):
	lst.append(oo + ee)
if len(o) - len(e) == 1:
	lst.append(o[-1])
print(''.join(lst))


o = list(input())
e = list(input()) + ['']
s = ''
for (i, j) in zip(o, e):
	s += i + j
print(s)


import math
import collections
ii = lambda : int(input())
mi = lambda : map(int, input().split())
li = lambda : list(map(int, input().split()))
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()


print(''.join([a + b for (a, b) in zip(input(), input() + ' ')]))


A = input()
B = input()
s = ''
for i in range(len(A)):
	s += A[i]
	if i < len(B):
		s += B[i]
print(s)


s = [input() for _ in range(2)]
print(''.join((s[i % 2][i // 2] for i in range(len(s[0]) + len(s[1])))))


o = input()
e = list(input())
a = ''
for s in o:
	a += s
	if e != []:
		a += e.pop(0)
print(a)


O = input()
E = input()
for i in range(min(len(O), len(E))):
	print(O[i], E[i], sep='', end='')
if len(O) > len(E):
	print(O[-1])


(a, b) = (input(), input())
n = [i + j for (i, j) in zip(a, b)]
print(*[n, n + [a[-1]]][len(a) - len(b) == 1], sep='')


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


a = ''
(s, t) = (input(), input())
for i in range(len(s)):
	a += s[i]
	if i < len(t):
		a += t[i]
print(a)


O = list(input())
E = list(input())
len_ = len(E)
for i in range(len_):
	O.insert(i * 2 + 1, E[i])
print(''.join(O))


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


s = input()
t = input()
ans = ''
for i in range(len(t)):
	ans += s[i] + t[i]
if len(s) - len(t):
	ans += s[-1]
print(ans)


O = input()
E = input()
N = str()
for i in range(len(E)):
	N += O[i] + E[i]
if len(O) > len(E):
	N += O[len(O) - 1]
print(N)


from math import gcd
from itertools import combinations, permutations, accumulate, product
from collections import deque, defaultdict, Counter
import decimal
import re
import math
import bisect
import heapq
import sys
sys.setrecursionlimit(10000000)
mod = 10 ** 9 + 7
INF = float('inf')
from sys import stdin
readline = stdin.readline

def readInts():
	return list(map(int, readline().split()))

def readTuples():
	return tuple(map(int, readline().split()))

def I():
	return int(readline())
o = input()
e = input()
ans = ''
for i in range(len(o)):
	ans += o[i]
	if i >= len(e):
		pass
	else:
		ans += e[i]
print(ans)


a = input()
b = input()
c = len(a)
d = len(b)
x = ''
if c <= d:
	for i in range(c):
		x = x + a[i]
		x = x + b[i]
	print(x)
if c > d:
	for i in range(d):
		x = x + a[i]
		x = x + b[i]
	x = x + a[len(a) - 1]
	print(x)


O = list(input())
E = list(input())
ans = [0] * (len(O) + len(E))
for i in range(len(ans)):
	if i % 2 == 0:
		ans[i] = O[0]
		del O[0]
	else:
		ans[i] = E[0]
		del E[0]
print(''.join(ans))


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


O = input()
E = input()
S = ''
for (i, o) in enumerate(O):
	S += o
	if E:
		S += E[0]
		E = E[1:]
print(S)


s = input()
t = input()
for i in range(len(s)):
	print(s[i], end='')
	if i < len(t):
		print(t[i], end='')


import itertools as t
s = input()
d = input()
print(''.join([i + j for (i, j) in t.zip_longest(s, d, fillvalue='')]))


o = input()
e = input()
pw = ''
for i in range(len(o)):
	pw += o[i]
	if i < len(e):
		pw += e[i]
print(pw)


O = input()
E = input()
i = 0
for i in range(len(O)):
	print(O[i], end='')
	if i < len(E):
		print(E[i], end='')
	i += 1


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


a = list(input())
b = list(input()) + ['']
for (c, d) in zip(a, b):
	print(c + d, end='')


(o, e) = [input() for _ in range(2)]
print(''.join((x + y for (x, y) in zip(o, e + ' '))))


O = input()
E = input()
z = ''
for (s, t) in zip(O, E):
	z += s
	z += t
if len(E) < len(O):
	z += O[-1]
print(z)


list_o = list(input())
list_e = list(input()) + ['']
for (a, b) in zip(list_o, list_e):
	print(a + b, end='')


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


s = input() + ' '
t = input() + ' '
st = ''
for i in range(min(len(s), len(t))):
	st += s[i]
	st += t[i]
print(st)


odd = list(map(str, input()))
even = list(map(str, input()))
if len(odd) == len(even):
	L = len(odd) * 2
else:
	L = len(odd) + len(even)
li = []
for i in range(1, L + 1):
	if i % 2 == 1:
		if i == 1:
			li.append(odd[0])
		else:
			li.append(odd[i // 2])
	else:
		li.append(even[i // 2 - 1])
print(''.join(li))


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


O = list(input())
E = list(input()) + ['']
s = ''
for (o, e) in zip(O, E):
	s += o + e
print(s)


(a, b) = (input(), input() + ' ')
print(*[i + j for (i, j) in zip(a, b)], sep='')


o = input()
e = input()
s = []
i = 1
j = 0
while True:
	if i % 2 == 0:
		s.append(e[j])
		i += 1
		j += 1
	else:
		s.append(o[j])
		i += 1
	if i >= len(o) + len(e) + 1:
		break
for i in range(len(s)):
	print(s[i], end='')


q = str(input())
e = str(input())
a = len(q)
b = len(e)
c = ''
if a == b:
	for i in range(a):
		c += q[i]
		c += e[i]
else:
	for i in range(b):
		c += q[i]
		c += e[i]
	c += q[a - 1]
print(c)


(*O,) = open(0)
print(''.join((o + e for (o, e) in zip(*O))))


o = input()
e = input()
e += ' '
ret = ''
for (i, j) in zip(o, e):
	ret += i
	ret += j
print(ret.strip())