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.

Difficulty: introductory

Starter code:

Solutions:
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 = 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()
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 = 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)


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

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,b=input(),input();n=[i+j for i,j in zip(a,b)]
print(*[n,n+[a[-1]]][len(a)-len(b)==1],sep='')

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()
e += " "
ans = ""
for i in range(len(o)):
    ans += o[i]
    ans += e[i]
print(ans)

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

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

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


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

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

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)

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

#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from math import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect
import heapq
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入g
#
# インデックス系
# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);
# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
#mod = 998244353
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)


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

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

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

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=input()
e=input()
p=""
for i in range(len(e)):
    p+=o[i]
    p+=e[i]
if len(o)!=len(e):
    p+=o[-1]
print(p)




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


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


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)

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

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


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


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)

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)

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

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)


#n = int(input())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
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)


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)

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


o = input()
e = input()
ans = ''
if len(o) == len(e):
    time = len(o) * 2
else:
    time = len(o) * 2 - 1
for i in range(time):
    if i % 2 == 0:
        ans += o[i // 2]
    else:
        ans += e[i // 2]
print(ans)

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

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

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 = 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())
e = list(input())
for i in range(len(e)):
    print(o[i],end="")
    print(e[i],end="")
if len(o) > len(e):
    print(o[-1])

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

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

ans = list()

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()
d = ""
if len(o) == len(e):
  for i in range(len(o)):
    d += o[i]
    d += e[i]
  print(d)
else:
  for i in range(len(e)):
    d += o[i]
    d += e[i]
  d += o[-1]
  print(d)

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

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)

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

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)

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

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


o=input()
e=input()

p=""

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




o = str(input())
e = str(input())

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

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])
print("".join(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])

#-*-coding:utf-8-*-
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()

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()
ans = ''
for i in range(len(e)):
    ans += o[i] + e[i]
if len(o) - len(e) == 1:
    ans += o[len(o)-1]
print(ans)

o = input()
e = input()

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

if len(o) != len(e):
    print(o[len(o)-1])

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


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)


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)

#58B
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 = input()
e = input()

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

print(ans)


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

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

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 = 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(E)):
    S += O[i] + E[i]
  S += O[len(O)-1]
  
print(S)

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)

o = input()
e = input()
a = ""

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

print(a)

O = list(input())
E = list(input())+[""]

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


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

#!/usr/bin/env python3

def main():
    a = list(input())
    b = list(input()) + [""]
    for i in range(len(a)):
        print(a[i], end="")
        print(b[i], end="")


def __starting_point():
    main()

__starting_point()

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)

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)

# B - ∵∴∵
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()

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)


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
#MOD = 998244353


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

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

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,b=input(),input()+' ';print(*[i+j for i,j in zip(a,b)],sep='')

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

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

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

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

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

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

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

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

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())
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 = list(input())
e = list(input()) + [""]
ans = "".join(o + e for o, e in zip(o, e))
print(ans)

#!/usr/bin/env python3

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 = list(input())
E = list(input())+['']
print(*[o+e for o,e in zip(O,E)], sep="")


O = input()
E = input()

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