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

l = len(o)+len(e)+1
r = ''
o_count = 0
e_count = 0
for i in range(1, l):
  if i % 2 == 0:
    r += e[i - (2 + o_count)]
    o_count += 1
  else:
    r += o[i - (1 + e_count)]
    e_count += 1

print(r)

Solution (Python):

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



import sys
import copy
import bisect
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examB()

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

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, e = [input() for _ in range(2)]

password = ''

if len(o) == len(e):
    for i in range(len(o)):
        password += o[i] + e[i]
elif len(o) > len(e):
    password += o[0]

    for i in range(len(e)):
        password += e[i] + o[i + 1]

print(password)

Solution (Python):
O = input()
E = input()
lenE = len(E)
res = ""

for i in range(len(O)):
    res += O[i]
    if i < lenE: res += E[i]

print(res)

Solution (Python):

from collections import deque
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

O = si()
E = si()
N = len(O) + len(E)

O = [ o for o in O]
E = [ e for e in E]
O = deque(O)
E = deque(E)
ans = ''

for i in range(N):
    if i%2==0:
        ans += O.popleft()
    else:
        ans += E.popleft()
print(ans)

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

Solution (Python):
O=str(input())
E=str(input())
data=[O[i]+E[i] for i in range(len(E))]
if len(O)!=len(E):
    data.append(O[-1])
print(''.join(data))

Solution (Python):
def main(o, e):
    for _o, _e in zip(o, e):
        print(_o + _e, end='')

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


if __name__ == "__main__":
    o = input()
    e = input()

    main(o, e)

Solution (Python):
O = str(input())
E = str(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)):
    if i < len(E):
        ans += O[i] + E[i]
    else:
        ans += O[i]

print(ans)

Solution (Python):
odd = input()
even = input()
if len(odd) != len(even):
    even = even + "\n"
password = ""
for o, e in zip(odd, even):
    password = password + o + e

print(password, end="")

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

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

s = input()
t = input()
n = len(s)
m = len(t)
L = ''
for i in range(n):
    L += s[i]
    if i >= m:
        continue
    L += t[i]
print(L)

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

L=[0]*(len(a)*2)

def AA(p):
      for i in range(p):
          L[i*2]=a[i]
          L[i*2+1]=b[i]

if len(a)==len(b):
  AA(len(a))
else:
  AA(len(a)-1)
  L[-2]=a[-1]
  del L[-1]
 
print("".join(L))

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

L=[0]*(len(a)*2)

if len(a)==len(b):
    for i in range(len(a)):
        L[i*2]=a[i]
        L[i*2+1]=b[i]
else:
  for i in range(len(a)-1):
    L[i*2]=a[i]
    L[i*2+1]=b[i]
  L[-2]=a[-1]
  del L[-1]
 
print("".join(L))

Solution (Python):
O = input()
E = input()
E += ' '
result = ''
for s1, s2 in zip(O, E):
    result += s1 + s2
    result = result.replace(' ','')
print(result)

Solution (Python):
a=input()
b=input()
n=[]
for i in range(len(a)):
  n.append(a[i])
  if i<=len(b)-1:
    n.append(b[i])
print("".join(n))

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

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

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 = list('a' * (len(o) + len(e)))
tmp = 0
for i in range(0, len(ans), 2):
    ans[i] = o[tmp]
    tmp += 1
tmp = 0
for i in range(1, len(ans), 2):
    ans[i] = e[tmp]
    tmp += 1
print("".join(ans))

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

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

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], 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):
o = input()
e = input()

lo = len(o)
le = len(e)
i = 0
res = []
while True:
    if i == len(o):
        break
    else:
        res.append(o[i])
    if i == len(e):
        break
    else:
        res.append(e[i])
        i += 1

print(''.join(res))

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

if len(o)-len(e)==1:
  s=["a"]*(2*len(e)+1)
else:
  s=["a"]*(2*len(e))

for i in range(len(o)):
  s[i*2]=o[i]

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

for k in s:
  print(k,end="")

print("")

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

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

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

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):
O = list(input())
E = list(input())+ [""]
for x,y in zip(O,E):
    print(x+y,end="")

Solution (Python):
O = input()
E = input()
dif_len = len(O) - len(E)
password = ''

if dif_len == 0:
    for i in range(len(O)):
        password += O[i] + E[i]
elif dif_len > 0:
    for i in range(len(O)):
        if i != len(O) - 1:
            password += O[i] + E[i]
        else:
            password += O[i]

print(password)

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

Solution (Python):
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)

Solution (Python):




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

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

print(ans)

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

Solution (Python):
X = input()
Y = input()
l = min(len(X),len(Y))
m = max(len(X),len(Y))
for i in range(l):
    if i==0:
        word = X[0]+Y[0]
    else:
        word += X[i]+Y[i]
x,y = [X],[Y]
if len(X) < len(Y):
    word += ''.join(y[0][l:])
    print(word)
elif len(X) > len(Y):
    word += ''.join(x[0][l:])
    print(word)
else:
    print(word)

Solution (Python):
O = input()
E = input()
str = ""
i = 0
while True:
  str += O[i]
  str += E[i]
  i+=1
  if len(E)-1<i:break
if len(O)-len(E)==1:
  str+=O[-1]
print(str)

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

answer = ""
for i in range(len(O)+len(E)):
  if (i+1) % 2 != 0:
    answer += O[i//2]
  else:
    answer += E[i//2]

print(answer)

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

Solution (Python):
O = input().strip()
E = input().strip()
x = ""
for i in range(2*len(E)):
    if i%2==0:
        x += O[i//2]
    else:
        x += E[i//2]
if len(O)>len(E):
    x += O[-1]
print(x)

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

for i in range(len(even)):
    pw+=odd[i]+even[i]
if len(odd)!=len(even):
    pw+=odd[-1]

print(pw)

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

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

Solution (Python):
O = input()
E = input()
answer = ""
i = 1
o = 0
e = 0
while i < len(E)+len(O)+1:
  if i % 2 != 0:
    answer += O[o]
    o += 1
  else:
    answer += E[e]
    e += 1
  i += 1

print(answer)

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

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

Solution (Python):
s1=input()
s2=input()
n=len(s1)
ans=''
for i in range(min(len(s1),len(s2))):
    ans+=s1[i]+s2[i]

if i!=len(s1)-1:
    ans+=s1[i+1]
if i!=len(s2)-1:
    ans+=s2[i+1]
print(ans)

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

Solution (Python):
O = input()
E = input()
for i, j in zip(O, E):
    print(i, end='')
    print(j, end='')
if len(O) > len(E):
    print(O[-1], end='')

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

Solution (Python):
x=input()
y=input()

result=[]
for i in range(len(y)):
  result.append(x[i]+y[i])
if len(x) - len(y) == 1:
  result.append(x[len(x)-1])
print("".join(result))

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

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

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

result = ""

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

print(result)

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

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

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

Solution (Python):
O,E = [input() for i in range(2)]
password = ""
for j in range(len(O)):
    password += O[j]
    if j < len(E):
        password += E[j]
    else:
        break
print(password)

Solution (Python):
from itertools import zip_longest

o, e = (input() for _ in range(2))

print(''.join(''.join(x) for x in zip_longest(o, e, fillvalue='')))

Solution (Python):
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)

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 s,t in zip(o,e):
    print(s+t,end='')

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

Solution (Python):

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

ans="".join(ans)
print(ans)

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

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

ans = ''.join(chars)
print(ans)

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

Solution (Python):
o = input()
e = input()
password = ""
for i, one_o in enumerate(o):
  if i < len(e):
    password += one_o + e[i]
  else:
    password += one_o
print(password)

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

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

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

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

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

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

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

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

s = ''
for i in range(lo-1):
  s += o[i]
  s += e[i]

s += o[lo-1]
if lo==le:
  s += e[le-1]
  
print(s)

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()
a=len(o)+len(e)
ans=''
for i in range(a):
    if len(ans)%2 == 0:
        ans +=o[i//2]
    else:
        ans +=e[i//2]

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

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

len_o = len(o)
len_e = len(e)

ans = ''
for i in range(max(len_o, len_e)):
    if i < len_o:
        ans += o[i]
    if i < len_e:
        ans += e[i]

print(ans)

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    o = str(input().rstrip('\n'))
    e = str(input().rstrip('\n'))
    ans = []
    for i in range(51):
        if i < len(o):
            ans.append(o[i])
        if i < len(e):
            ans.append(e[i])
    print("".join(ans))


if __name__ == '__main__':
    slove()

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

N=len(O)
M=len(E)

ans=['null' for a in range(N+M)]

for n in range(N):
  ans[2*n]=O[n]

for m in range(M):
  ans[2*m+1]=E[m]

print(''.join(ans))

Solution (Python):
o, e = input(), input()
s = ''
o_idx = 0
e_idx = 0
i = 0
while o_idx < len(o) or e_idx < len(e):
    if i % 2 == 0:
        s += o[o_idx]
        o_idx += 1
    else:
        s += e[e_idx]
        e_idx += 1
    i += 1
print(s)

Solution (Python):
a=input()
b=input()
s=[""]*(101)
for i in range(len(a)):
    s[2*i+1]=a[i]
for j in range(len(b)):
    s[2*j+2]=b[j]
print("".join(s))

Solution (Python):
a = input()
b = input()
ans = ''
for i in range(max(len(a), len(b))):
    if i < len(a):
        ans += a[i]
    if i < len(b):
        ans += b[i]
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()
password = ""
for i in range(len(O)):
    password += O[i]
    if i < len(E):
        password += E[i]
print(password)

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

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

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

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

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

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

print(ans)

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

Solution (Python):
o = input()
e = input()
o_count = 0
e_count = 0
ans = ''
for i in range(len(o) + len(e)):
    if i % 2 == 1:
        ans += e[e_count]
        e_count += 1
    else:
        ans += o[o_count]
        o_count += 1
print(ans)

Solution (Python):
O = input()
E = input()
o = 0
e = 0
ans = ''

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

print(ans)

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

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

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

Solution (Python):

O = input()
E = input()
S = []
for i in range(len(O)-1):
    S.append(O[i])
    S.append(E[i])
if (len(O) == len(E)):
    S.append(O[-1])
    S.append(E[-1])
else:
    S.append(O[-1])
    
print(*S, sep="")

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

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

Solution (Python):


O = input()
E = input()

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

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

print(ans)

Solution (Python):
ki=list(input())
gu=list(input())

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

Solution (Python):
o = list(input())
e = list(input())
to = [(2*i+1,o[i])for i in range(len(o))]
te = [(2*i+2,e[i])for i in range(len(e))]
p = sorted(to+te)
print(''.join(i[1] for i in p))

Solution (Python):



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


for i in range(len(O) + len(E)):
    if i % 2 == 0:
        print(O.pop(0), end='')
    else:
        print(E.pop(0), end='')

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):
O = input()
E = input()
ans = ""

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

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

    ans += O[i+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 = input().rstrip()
e = input().rstrip()
res = [''] * (len(o) + len(e))
for i in range(len(o)):
    res[2 * i] = o[i]
for i in range(len(e)):
    res[2 * i + 1] = e[i]
print(''.join(res))

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

Solution (Python):
from itertools import zip_longest
S = zip_longest(list(input()), list(input()), fillvalue='')
print(''.join(map(lambda t: ''.join(t), S)))

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

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

ans = ''

for s, t in zip(o, e):
    ans += s+t

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

print(ans)

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

password = ''

for s, t in zip(o, e):
    password += s
    password += t

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

print(password)

Solution (Python):
o = list(input())
e = list(input())
n = max(len(o), len(e))
ans = []

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

print(''.join(ans))

Solution (Python):
from collections import deque

O=deque(list(input()))
E=deque(list(input()))
N=max(len(O),len(E))



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

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

if len(o) >= len(e):
    times = len(e)
else:
    times = len(o)

for i in range(times):
  password = password + o[i]
  password = password + e[i]

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

print(password)

Solution (Python):
o, e = [input() for _ in range(2)]
string = ""
for i in range(min(len(o), len(e))):
    string = string + o[i] + e[i]
if len(o) - len(e) == 1:
    string += o[-1]
print(string)

Solution (Python):
def resolve():
    o = input()
    e = input()
    if len(o) == len(e):
        ans = "".join([oi + ei for oi, ei in zip(o, e)])
    elif len(o) > len(e):
        ans = "".join([oi + ei for oi, ei in zip(o, e)]) + o[-1]
    else:
        ans = "".join([oi + ei for oi, ei in zip(o, e)]) + e[-1]
    print(ans)


if __name__ == "__main__":
    resolve()

Solution (Python):
odd_number = input()
even_number = input()
passwd = ""
for i in range(len(even_number)):
  passwd += odd_number[i]
  passwd += even_number[i]
if len(odd_number) - len(even_number) == 1:
  passwd += odd_number[len(odd_number) - 1]
print(passwd)

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

ol, el = len(O), len(E)

ans = ""
for i in range(min(ol, el)):
    ans += O[i] + E[i]

if ol != el:
    if ol > el:
        ans += O[-1]
    else:
        ans += E[-1]
print(ans)

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

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

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

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

S = [o, e]
j = 0
ans = ""
for i in range(len(o) + len(e)):
    ans += S[j][i//2]
    j = (j + 1) % 2

print(ans)

Solution (Python):

O = str(input())
E = str(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[len(O)-1]
elif len(O) >= len(E):
    for i in range(len(O)):
        ans += O[i]+E[i]
    ans += E[len(E)-1]

print(ans)

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

ans = ''.join(map(lambda a: a[0] + a[1], zip(o, e)))





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

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

Solution (Python):
import sys
input = sys.stdin.readline

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

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

if __name__ == "__main__":
    main()

Solution (Python):
o=list(input())
e=list(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(''.join(ans))

Solution (Python):
*O,=open(0);print("".join(o+e for o,e in zip(*O)))

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

Solution (Python):
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)

Solution (Python):
even = input()
odd = input()
answer = []
for i in range(len(even)*2):
  try:
    if i%2 == 0:
        answer.append(even[i//2])
    else:
        answer.append(odd[i//2])
  except:
    pass
print(*answer,sep = "")

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

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 = ['0']*(len(O)+len(E))
ans[::2] = O
ans[1::2] = E
print(''.join(ans))

Solution (Python):
even = str(input())
odd = str(input())
ans = ""
if len(even) == len(odd):
  for i in range(len(even)):
    ans += even[i] + odd[i]
  
else:
  for i in range(len(even)-1):
    ans += even[i] + odd[i]
  ans += even[-1]

print(ans)

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

A = list(A)
B = list(B)

AL = len(A)
BL = len(B)

b = []
for i in range(BL):
  b.append(A[i] + B[i])
if AL -BL == 1:
    
  b.append(A[-1])
print(",".join(b).replace(",", ""))

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

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

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(E)):
  print(O[i]+E[i], end='')
if len(O) != len(E):
  print(O[-1], 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):
o=list(input())
e=list(input())+[""]
for x,y in zip(o,e):print(x+y,end="")

Solution (Python):
o = input()
e = input()
l = []
while True:
    if len(o) > len(e):
        e = e + ' '
    elif len(o) < len(e):
        o = o + ' '
    else:
        break
for i, j in zip(o, e):
    l.append(i+j)
print(''.join(l).replace(' ', ''))

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])
    print(''.join(ans))
else:
    for i in range(len(e)):
        ans.append(o[i])
        ans.append(e[i])
    ans.append(o[-1])
    print(''.join(ans))

Solution (Python):

import sys


def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

O = list(IS())
E = list(IS())
t = ""
i = 0
for i in range(len(O)):
    a = O[i]
    if len(E) != 0:
        b = E.pop(0)
        t += a + b
    else:
        t += a
print(t)

Solution (Python):
s = input().strip()
t = input().strip()
for _s, _t in zip(s, t):
  print(_s, end='')
  print(_t, end='')
if len(s) != len(t):
  print(s[-1], end='')
print()

Solution (Python):
import sys
import collections
import copy
def input(): return sys.stdin.readline().strip()
A= input()
B=input()
ans = ""
n = len(A)+len(B)
for i in range(n):
    if i%2 == 0:
        ans= ans+A[i//2]
    else:
        ans= ans+B[(i-0)//2]
print(ans)

Solution (Python):
o = input()
e = input()
ans = ''
onum = 0
enum = 0
for i in range(len(o) + len(e)):
    if i % 2 != 0:
        ans += e[enum]
        enum += 1
    else:
        ans += o[onum]
        onum += 1
print(ans)

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

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

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

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

if len(o)>len(e):
  out = out+o[len(o)-1]
elif len(o)<len(e):
  out = out+e[len(e)-1]
else:
  out=out
print(out)

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):
import sys
import copy
import  math
from _bisect import *
from collections import *
from operator import itemgetter
from math import factorial
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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