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

o=list(O)
e=list(E)

str=[0 for i in range(len(o)+len(e))]
j=0
for i in range(0,len(o)):
    str[j]=o[i]
    j+=2
j=1
for i in range(0,len(e)):
    str[j]=e[i]
    j+=2
s=""
for i in range(len(str)):
    s=s+str[i]
print(s)

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

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

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

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

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

Solution (Python):

import sys

def INT(): return int(input())
def MAP(): return map(int,input().split())
def LI(): return list(map(int,input().split()))

def main():
    O = input()
    E = input()
    answer = ""
    for i in range(len(O+E)):
        if i%2 == 0:
            answer += O[i//2]
        else:
            answer += E[(i-1)//2]
    print(answer)

    return

if __name__ == '__main__':
    main()

Solution (Python):








def resolve():
    O=list(input())
    E=list(input())
    p=[]
    for i in range(len(O)):
        p.insert(i*2,O[i])
    for j in range(len(E)):
        p.insert(1+j * 2, E[j])

    print(''.join(p))

resolve()

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

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

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

Solution (Python):


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    O=input()
    E=input()
    ans=["a"]*100
    NO=len(O)
    NE=len(E)
    for i in range(NO):
        ans[i*2]=O[i]
    for i in range(NE):
        ans[i*2+1]=E[i]
        
    print(''.join(map(str, ans[:NO+NE])))

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):
o=list(input())
m=list(input())
"""
ans=[]
for i in range(len(o)-1):
            ans.append(o[i])
            ans.append(m[i])
ans.append(o[-1])
if len(o)==len(m):
            ans.append(m[-1])
print("".join(ans))
"""
ans=' '
for i in range(len(o)-1):
            ans +=o[i]
            ans +=m[i]
ans +=o[-1]
if len(o)==len(m):
            ans+=m[-1]
print(ans)

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

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):


O = input()
E = input()

len_E = len(E)
len_O = len(O)

E_count = 0
O_count = 0

total_len = len_E + len_O

ans = ''

for t in range(1, total_len + 1):
    if t % 2 == 0:
        ans = ans + E[E_count]
        E_count += 1
    else:
        ans = ans + O[O_count]
        O_count += 1

print(ans)

Solution (Python):
oo=input().strip()
ee=input().strip()

ol=[]
el=[]
for o in oo:
  ol.append(o)

for e in ee:
  el.append(e)

if len(ol)!=len(el):
  el.append("")

ans=""
for i in range(len(ol)):
  ans+=ol[i]
  ans+=el[i]
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) == 1:
    ans += O[len(O)-1]
print(ans)

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

Solution (Python):
O=input()
E=input()
a=[b for b in O]
c=[d for d in E]
answer=[]
count=0
while not count==len(c):
    answer.append(O[count])
    answer.append(E[count])
    count+=1
if len(a)-len(c)==1:
    answer.append(O[len(a)-1])
moji=''
for z in answer:
    moji+=z
print(moji)

Solution (Python):
o = input()
e = input()
i = 0
l = []
while i < len(o):
  l.append(o[i])
  if i == len(e):
    break
  else:
    l.append(e[i])
  i += 1
print(*l,sep="")

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

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

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

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

Solution (Python):

import sys


def solve(O: str, E: str):
    print("".join(oi + ei for oi, ei in zip(O, E + " ")).strip())


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    O = next(tokens)  
    E = next(tokens)  
    solve(O, E)


if __name__ == '__main__':
    main()

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

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

for i in range(len(e)):
    pword.append(o[i])
    pword.append(e[i])
if len(o)>len(e):
    pword.append(o[i+1])
print("".join(pword))

Solution (Python):

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

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

if len_o == len_e:
    for i in range(len_o - 1):
        print(o[i], end = '')
        print(e[i], end = '')
    print(o[len_o - 1], end = '')
    print(e[len_e - 1])

else:
    for i in range(min(len_o, len_e)):
        print(o[i], end = '')
        print(e[i], end = '')
    if len_e > len_o:
        print(e[len(e) - 1])
    if len_o > len_e:
        print(o[len(o) - 1])

Solution (Python):
a = input()
b = input()
c = ""
for i in range(ｌｅｎ(a)):
  if i == len(b):
  	c += a[i]
  else:
    c += a[i] + b[i]
print(c)

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

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

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

num = len(O) + len(E)
password =''
for i in range(1, num+1):
  if i % 2 ==0:
    n = i // 2
    password += E[n-1]
  else:
    n = i // 2 + 1
    password += O[n-1]
print(password)

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,j in zip(o,e):
  ans+=i
  ans+=j
  
print(ans)

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

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

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

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

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

for i in range(len(O)):
  o.append(O[i])
  
for j in range(len(E)):
  e.append(E[j])
  
if len(o) == len(e):
  for k in range(len(o)):
    ans.append(o[k])
    ans.append(e[k])
    
  print("".join(ans))
  exit()
  
if len(o) != len(e):
  for l in range(len(e)):
    ans.append(o[l])
    ans.append(e[l])
    
  ans.append(o[-1])
  print("".join(ans))
  exit()

Solution (Python):
from collections import deque
o = deque(list(input()))
e = deque(list(input()))
pas = []
while (o or e):
    if o:
        pas.append(o.popleft())
    if e:
        pas.append(e.popleft())
    
print(*pas, sep="")

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

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

if len(a) > len(b):
    c.append(a[-1])

print(''.join(c))

Solution (Python):
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    ODD = list(map(str, sys.stdin.readline().rstrip()))
    EVEN = list(map(str, sys.stdin.readline().rstrip()))+[""]

    for o, e in zip(ODD, EVEN):
        print(o+e, end="")


if __name__ == '__main__':
    main()

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

Solution (Python):

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

Solution (Python):
a = input()
b = input()
f = abs(len(a) - len(b))
if f== 0 :
  pass
else :
  if len(a)<len(b):
    a+=" "
  else :
    b += " "
s = ""
for i,j in zip(a,b):
  s+= i+j
print(s.replace(' ', ''))

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

print("".join(ans))

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

Solution (Python):
O = input()
E = input()
ans = [None] * (len(O)+len(E))
ans[::2],ans[1::2] = O,E
print(''.join(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.append(o[i//2])
        else:
                ans.append(e[i//2])
print(*ans,sep="")

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):
odd=list(input())
even=list(input())
ans=[]
for i in range(1,len(odd)+len(even)+1):
    if i%2!=0:
        ans.append(odd[i//2])
    else:
        ans.append(even[i//2-1])
for i in range(len(ans)):
    print(ans[i],end="")

Solution (Python):
import sys
import bisect
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
o = readline().rstrip().decode('utf-8')
e = readline().rstrip().decode('utf-8')
ans = []
for i in range(len(e)):
    ans.append(o[i])
    ans.append(e[i])
if len(o) == len(e)+1:
    ans.append(o[-1])

print("".join(ans))

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

Solution (Python):
def main():
    odd_str = input()
    even_str = input()
    answer = [""] * (len(odd_str) + len(even_str))
    for i in range(len(odd_str)):
        answer[2 * i] = odd_str[i]
    for i in range(len(even_str)):
        answer[2 * i + 1] = even_str[i]
    print("".join(answer))


if __name__ == '__main__':
    main()

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

Solution (Python):
from itertools import zip_longest

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

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

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

[print(x+y,end="") for x, y in zip(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):
A=input()
B=input()
ans=[]
for i in range(len(B)):
	ans.append(A[i])
	ans.append(B[i])
if len(A)>len(B):
  ans.append(A[-1])
print("".join(ans))

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

i = 0

while i < len(x):
  print(x[i], end="")
  if i >= len(y):
    break
  print(y[i], end="")
  i += 1

Solution (Python):



O = input().strip()
E = input().strip()


new_S=""
for i in range(1,len(O)+len(E)+1):
    if (i % 2) == 1:
        new_S += O[i // 2]
    else:
        new_S += E[i // 2 - 1]

print(new_S)

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

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

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

Solution (Python):
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[-1], end='')
print()

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

import sys


def solve(O: str, E: str):
    password = ''
    for i in range(len(O)):
        password += O[i]
        if len(E) > i:
            password+= E[i]
    print(password)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    O = next(tokens)  
    E = next(tokens)  
    solve(O, E)

if __name__ == '__main__':
    main()

Solution (Python):


if __name__ == '__main__':
    O=input()
    E=input()
    O=list(O)
    E=list(E)
    password=[]
    n=min(O.__len__(),E.__len__())
    for i in range(n):
        password.append(O.pop(0))
        password.append(E.pop(0))
    password+=O
    password+=E
    print("".join(password))

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

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

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

Solution (Python):
O,E = [input() for _ in range(2)]
S = []
for i in range(len(O)):
    S.append(O[i])
    if i<=len(E)-1:S.append(E[i])
print(*S,sep='')

Solution (Python):
O = str(input())
E = 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,e=[input() for _ in range(2)]
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)

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

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

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

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

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

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

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

Solution (Python):
o=input()
e=input()
ans=['']*(len(o)+len(e))
flg=1
for i in range(len(o)):
	ans[i*2]=o[i]
for j in range(len(e)):
	ans[j*2+1]=e[j]
for k in range(len(ans)):
	print(ans[k],end="")

Solution (Python):
s=input()+' '
t=input()+' '
st=''

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

Solution (Python):
s=input()+' '
t=input()+' '
st=''

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

Solution (Python):
o = input()
e = input()
lis = []
for i in range(min(len(o),len(e))):
    lis.append(o[i])
    lis.append(e[i])
if len(o)>len(e):
    lis.append(o[-1])

print(''.join(lis))

Solution (Python):
o = input()
e = input()
s = ['_']*(len(o)+len(e))
for i,c in enumerate(o):
  s[2*i] = c
for i,c in enumerate(e):
  s[2*i+1] = c
print(''.join(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)==1:
    ans+=o[-1]
print(ans)

Solution (Python):
a=input()
b=input()
n=0
c=1
S=""
if len(a)==len(b):
    for _ in range(len(a)):
        S=(S+(a[n]+b[n]))
        n+=1
    print(S)
else:
    for _ in range(len(b)):
        S=(S+(a[n]+b[n]))
        n+=1
    print(S+a[n])

Solution (Python):
ol = list(input())
el = list(input())
ans = ''

for i in range(min(len(ol), len(el))):
    ans += ol.pop(0) + el.pop(0)
if len(ol) > 0:
    ans += ol.pop()

print(ans)

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

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

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

for i in range(len(E)):
    pswd="".join((pswd,O[i],E[i]))

if len(O)>len(E):
    pswd="".join((pswd,O[len(O)-1]))

print(pswd)

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

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

Solution (Python):
O = list(input())
E = list(input())
N = len(O)+len(E)
if len(O)>len(E):
    E += ' '
elif len(O)<len(E):
    O += ' '
answer = []
for i,j in zip(O,E):
    answer.append(i)
    answer.append(j)
print(''.join(answer))

Solution (Python):

A = input()
E = input()

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

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

ans=[]

for oo,ee in zip(o,e):
    ans.append(oo+ee)

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

count=0
for oo in o:
    ans[count] = oo
    count+=2
    
count=1
for ee in e:
    ans[count] = ee
    count+=2

print("".join(ans))

Solution (Python):




def main():
    O = list(input())
    E = list(input())
    for o, e in zip(O, E):
        print(o, e, end='', sep='')
    if len(O) > len(E):
        print(O[-1])


if __name__ == "__main__":
    main()

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

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

Solution (Python):
def pw(o , e):
    ans = ""
    olist = list(o)
    elist = list(e)

    for i in range(len(e)):
        ans += olist[i]
        ans += elist[i]

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

    return ans


def main():
    o = str(input())
    e = str(input())
    print(pw(o , e))

if __name__ == '__main__':
    main()

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()
letter=""
for o in O:
    letter+=o+"!"

for e in E:
    letter=letter.replace("!",e,1)
letter=letter.rstrip("!")
print(letter)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

O = input()
E = input()

ans = ""
for x, y in zip(O, E):
	ans += x+y
if (len(O)-len(E))%2==1:
	ans += O[-1]
print(ans)

Solution (Python):
import sys

O = list(input())
E = list(input())
if len(O) - len(E) == 1:
    E.append('')
for o, e in zip(O, E):
    sys.stdout.write(o + e)
print()

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

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

n = len(o+e)

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

print(ans)

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

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

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a = list(input())
b = list(input())
l = []

while len(a) != 0 or len(b) != 0:
    
    if len(a) != 0:
        l.append(a.pop(0))
        
    if len(b) != 0:
        l.append(b.pop(0))
        
    
print("".join(l))

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) > i+1:
    print(o[-1])
elif len(e) > i+1:
    print(e[-1])

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):
"""
author : halo2halo
date : 31, Jan, 2020
"""

import sys




read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

O, E = read().decode('utf8').split()

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

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

print(ans)

Solution (Python):
A=str(input())
B=str(input())
a=list(A)
b=list(B)
t=''
for i in range(len(b)):
  t+=a[i]+b[i]
if len(a)>len(b):
  t+=a[len(a)-1]
print(t)

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

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

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

print(p)

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

for o, e in zip(O, E):
    print(o, e, sep='', end='')

if len(O) != len(E):
    print(O[-1])
else:
    print()

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):
even = input()
odd = input()
if (len(even) - len(odd)) % 2 == 0:
    for i in range(len(even)):
        print(even[i], odd[i], sep="", end="")
else:
    for i in range(len(even)-1):
        print(even[i], odd[i], sep="", end="")
    print(even[-1])

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

for i in range(len(o)):
    ans.append(o[i])
    if(len(e) > i):
        ans.append(e[i])
print(''.join(ans))

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

for i in range(len(odd)+len(even)):
  if i % 2 == 0:
    s += odd[i//2]
  else:
    s += even[(i-1)//2]
print(s)

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

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

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    s0 = SI()
    s1 = SI()
    ans = [""] * (len(s0) + len(s1))
    for i in range(len(s0)):
        ans[i * 2] = s0[i]
    for i in range(len(s1)):
        ans[i * 2 + 1] = s1[i]
    print("".join(ans))

main()

Solution (Python):
o, e = input(), input()
d = len(o) - len(e)

ans = ""
if  d == 0:
    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)

Solution (Python):

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

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

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

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

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

if len(o) - len(e) == 1:
  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[len(o)-1]

print(ans)

Solution (Python):
from itertools import zip_longest
s1=input()
s2=input()
ans=''
for ss1,ss2 in zip_longest(s1,s2):
  if ss1 == None:
    ss1=''
  if ss2 == None:
    ss2=''
  ans+=ss1+ss2
  
print(ans)

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

a = len(o)-len(e)
s = ""

if a == 0:
    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[len(o)-1]
print(s)

Solution (Python):

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

Solution (Python):

O=list(input())
E=list(input())
passward =""

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

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

Solution (Python):
s = input()
t = input()
ans = ""

while len(t) > 0:
  ans += s[0] + t[0]
  s = s[1:]
  t = t[1:]
  
ans += s

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