Problem:
 Score : 200 points    Problem Statement Snuke signed up for a new website which holds programming competitions.
He worried that he might forget his password, and he took notes of it.
Since directly recording his password would cause him trouble if stolen,
he took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.  You are given two strings O and E . O contains the characters at the odd-numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order.
Restore the original password.      Constraints  O and E consists of lowercase English letters ( a - z ).  1 \leq |O|,|E| \leq 50  |O| - |E| is either 0 or 1 .         Input Input is given from Standard Input in the following format:  O  E       Output Print the original password.        Sample Input 1 xyz
abc      Sample Output 1 xaybzc  The original password is xaybzc . Extracting the characters at the odd-numbered positions results in xyz , and extracting the characters at the even-numbered positions results in abc .       Sample Input 2 atcoderbeginnercontest
atcoderregularcontest      Sample Output 2 aattccooddeerrbreeggiunlnaerrccoonntteesstt

Solution (Python):
O = list(input())
E = list(input())
if len(O) == len(E) :
    pas = ['8'] * (2 * len(O))
    for i in range(len(O)) :
        pas[2*i] = O[i]
        pas[2*i + 1] = E[i]
    p = ''.join(pas)
    print(p)
else :
    pas = ['0'] * (2 * len(E) + 1)
    for i in range(len(E)) :
        pas[2*i] = O[i]
        pas[2*i +1] = E[i]
    pas[2 * len(E)] = O[-1]
    p = ''.join(pas)
    print(p)

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    O=STR()
    E=STR()
    ans=[]
    ol=len(O)
    el=len(E)
    if ol-el==0:
        for i in range(ol):
            ans.append(O[i])
            ans.append(E[i])
    else:
        for i in range(el):
            ans.append(O[i])
            ans.append(E[i])
        ans.append(O[-1])
    print(*ans,sep='')
if __name__ == '__main__':
    do()

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

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

Solution (Python):

from itertools import zip_longest

def main():
    o = input()
    e = input()
    for i, j in zip_longest(o, e):
        print(i, end='')
        if j != None:
            print(j, end='')

main()

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

ans = [0] * (len(o) + len(e))

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

for i in range(len(e)):
    ans[i * 2 + 1] = e[i]

print("".join(ans))

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

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

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

Solution (Python):

O = input()
E = input()

ans = []

for i in range(50):
    try:
        ans.append(O[i])
        ans.append(E[i])
    except:
        break

print("".join(ans))

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

ans = []

for i in range(1, len(o) + len(e) + 1):
	if i % 2 == 1:

		ans.append(o.pop(0))
	else:
		ans.append(e.pop(0))

print("".join(ans))

Solution (Python):
O, E = [input() for _ in range(2)]

pass_word = []
for i in range(len(O)):
  if len(O) > len(E) and i == len(O) - 1:
    pass_word.append(O[i])
  else:
    pass_word.append(O[i])
    pass_word.append(E[i])

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

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

Solution (Python):


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

s = []
for i in o:
  s.append(i)
  if len(e) > 0:
    s.append(e.pop(0))

result = "".join(s)

print(result)

Solution (Python):
a = list(input())
s = list(input())
x = -1
while s != []:
    x += 2
    a.insert(x,s[0])
    s.pop(0)
print(''.join(a))

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

ans =[]
while True:
    if len(O):
        ans.append(O.pop(0))
    if len(E):
        ans.append(E.pop(0))

    if len(O)==0 and len(E)==0:
        break

print("".join(ans))

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

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

print(s)

Solution (Python):
a,b = list(input() for i in range(2))
str = ''
num = len(a)
if len(a) > len(b):
  b = b + ' '

for i in range(num):
  str = str + a[i] + b[i]
print(str.replace(' ', ''))

Solution (Python):
a,b = list(input() for i in range(2))
str = ''
num = max(len(a),len(b))
if len(a) < num:
  a = a + ' '
if len(b) < num:
  b = b + ' '
for i in range(num):
  str = str + a[i] + b[i]
print(str.replace(' ', ''))

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

print(ans)

Solution (Python):
from itertools import zip_longest
odd_num = input()
even_num = input()

print(''.join([x + y for x, y in zip_longest(odd_num, even_num, fillvalue='')]))

Solution (Python):
import sys
input = sys.stdin.readline
o=input().strip()
e=input().strip()
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 a, b in zip(o, e):
    print(a+b, end='')

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

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

if len(s)==len(t):
    print(ans)

elif len(s)>len(t):
    ans+=s[-1]
    print(ans)

else:
    ans+=t[-1]
    print(ans)

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

import itertools
passwd = [o+e for o, e in itertools.zip_longest(O, E, fillvalue='')]
passwd = ''.join(passwd)
print(passwd)

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

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

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

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

print(result)

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

Solution (Python):
import sys
input = sys.stdin.readline
O = list(input().rstrip())
E = list(input().rstrip())
if len(O) == len(E):
    ans = []
    for i, j in zip(O, E):
        ans.append(i)
        ans.append(j)
else:
    ans = [O.pop(0)]
    for i, j in zip(O, E):
        ans.append(j)
        ans.append(i)
print("".join(ans))

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

if (len(o) <= len(e)):
   x = len(o)
else:
   x = len(e)

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

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

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

Solution (Python):
O = str(input())
E = str(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()

password = ""

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

Solution (Python):
o = str(input())
e = str(input())
lst = []

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

Solution (Python):


o = input()
e = input()

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


ans = ""

while True:
    try:
        ans += o.pop(0)
        ans += e.pop(0)
    except:
        break

print(ans)

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

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

Solution (Python):
O = input()
E = input()
oc = len(O)
oe = len(E)
word = "" 
if oc < oe:
    for i in range (oc):
        word = word+O[i]+E[i]
    word = word+E[oc:oe]
    print(word)
elif oc > oe:
    for i in range (oe):
        word = word+O[i]+E[i]
    word = word+O[oe:oc]
    print(word)
else:
    for i in range (oe):
        word = word+O[i]+E[i]
    print(word)

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("{}{}".format(o[i], e[i]), 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 = input()
E = input()
ans = ""
for i in range(len(E)):
    ans += O[i] + E[i]
if len(O) == len(E):
  print(ans)
else:
  ans += O[-1]
  print(ans)

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

result = ""
for i in range(len(e)):
    result = result + o[i] + e[i]

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

Solution (Python):
import itertools
a=[i for i in input()]
b=[i for i in input()]
l=list(itertools.zip_longest(a,b,fillvalue=0))
ll=[]
for i in l:
  if i[0]!=0:
    ll.append(i[0])
  if i[1]!=0:
    ll.append(i[1])  
print("".join(ll))

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

Solution (Python):
O=list(input())
E=list(input())
L=[]

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

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

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

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

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

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

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

Solution (Python):

 
import math
import itertools
import sys
import copy
 




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

count = 0

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

print("".join(ans))

Solution (Python):

o = list(input())
e = list(input())
ans = []

count = 0

if len(o) > len(e):
    for i in range(len(e)):
        ans.append(o[i])
        ans.append(e[i])
    ans.append(o[-1])
elif len(o) < len(e):
    for i in range(len(o)):
        ans.append(o[i])
        ans.append(e[i])
    ans.append(e[-1])
else:
    for i in range(len(o)):
        ans.append(o[i])
        ans.append(e[i])

print("".join(ans))

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

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

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

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

Solution (Python):
import sys
MAX_INT = int(10e12)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

s = S()
t = S()

sN = len(s)
tN = len(t)

ans = ""
for ss,tt in zip(s,t):
  ans += ss + tt

if sN == tN:
  pass
else:
  ans += s[-1]

print(ans)

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

Solution (Python):
from itertools import zip_longest

odds, evens = [input() for _ in range(2)]
chars = []
for odd, even in zip_longest(odds, evens, fillvalue=""):
    chars.append(odd)
    chars.append(even)
ans = "".join(chars)
print(ans)

Solution (Python):
import math

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

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])
else:
    print()

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

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf')
ans = 0 ;count = 0 ;pro = 1

ans=[]
o=list(input())
e=list(input())
for i in range(len(e)):
    ans.append(o[i])
    ans.append(e[i])
if len(o)-len(e):
    ans.append(o[-1])
print(*ans,sep="")

Solution (Python):
o = input()
e = input()
if len(o)-len(e)>0:e+=" "
for a,b in zip(o,e):
    print(a+b.strip(),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):
a=input()
b=input()

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

Solution (Python):
o = list(input())
e = list(input())
if len(o) > len(e):
  e.append("")
 
for i in range(len(o)):
  print(o[i] + e[i], end='')

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

Solution (Python):
import sys

o, e = sys.stdin.read().split()

def main():
    s = [None] * (len(o) + len(e))
    s[::2] = list(o)
    s[1::2] = list(e)
    return ''.join(s)

if __name__ == '__main__':
    ans = main()
    print(ans)

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

answer = ''

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

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

print(answer)

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

answer = ''

for s, t in zip(o,e):
  answer += s
  answer += t
  
if len(o) > len(e):
  answer += o[-1]
  
print(answer)

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

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

ans = [i + j for i,j in zip(O,E)]
if len(O)-len(E) == 1:
  ans += O[-1]
print("".join(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 = ''
i1 = 0
i2 = 0
for i in range(len(o) + len(e)):
    if i % 2 == 0:
        ans += o[i1]
        i1 += 1
    else:
        ans += e[i2]
        i2 += 1
print(ans)

Solution (Python):
odd_chars = input()
even_chars = input()
output_chars = ""

for i in range(len(even_chars)):
    output_chars += odd_chars[i] + even_chars[i]

if len(odd_chars) > len(even_chars):
    output_chars += odd_chars[-1]

print(output_chars)

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

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

Solution (Python):
O, E = [input() for _ in range(2)]
E += " "

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

Solution (Python):
from itertools import zip_longest

O = input()
E = input()

ans = []
for o, e in zip_longest(O, E):
    ans.append(o)
    ans.append(e)

ans = [s for s in ans if s]
print("".join(ans))

Solution (Python):
O = input()
O_2 = list(O)
OLEN = len(O)

E = input()
E_2 = list(E)
ELEN = len(E)

ans = []

if ELEN >= OLEN:
    N = ELEN
else:
    N = OLEN



if OLEN == ELEN:
    for i in range(N):
        ans.append(O_2[i])
        ans.append(E_2[i])

elif OLEN  != ELEN:
    
    for i in range(N):
        if len(ans) == ((OLEN) + (ELEN) -1):
            if OLEN > ELEN:
                ans.append(O_2[-1])
            else:
                ans.append(E_2[-1])
            break
        ans.append(O_2[i])
        ans.append(E_2[i])


for i in ans:
  print(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())[::-1]
e=list(input())[::-1]

while True:
    try:
        print(o.pop(),end="")
        print(e.pop(),end="")
    except:
        break

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

l_o = len(o)
l_e = len(e)

PW = ""

if l_o == l_e:
    for i in range(l_e):
        PW += o[i]
        PW += e[i]
    print(PW)
else:
    for i in range(l_e):
        PW += o[i]
        PW += e[i]
    print(PW + o[l_o - 1])

Solution (Python):
k=input()
g=input()
ans=""
x=len(k)
y=len(g)
for i in range(max(x,y)):
    if i<x:
        ans+=k[i]
    if i<y:
        ans+=g[i]
print(ans)

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

l = []
for i in range(len(o)*2):
    if i %2 == 0:
        l.append(o[i//2])
    elif i//2 < len(e):
        l.append(e[i//2])
    else:
        pass

print(''.join(l))

Solution (Python):
O = input()
E = input()
al = ""
for o,e in zip(O,E):
  al += o
  al += e
if len(O) > len(E):
  
  for i in range(abs(len(O) - len(E)),0,-1):
    al += O[-i]
elif len(E) > len(O):
  for i in range(abs(len(O) - len(E)),0,-1):
    al += E[-i]





print(al)

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

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

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

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

print(ans)

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

Solution (Python):
O=list(input())
E=list(input())
password=[]

for i in range(len(O)):
    password.append(O[i])
    try:
        password.append(E[i])
    except:
        None

print(''.join(password))

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

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

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

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

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

print(moji)

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(min(len(O), len(E))):
    print(O[i], E[i], sep="", end="")
if len(O) > len(E):
    print(O[-1])

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

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

Solution (Python):
o = input()
e = input()
res = ''
for ao, ae in zip(o, e):
    res = res + ao + ae
if len(o) != len(e):
    res += o[-1]
print(res)

Solution (Python):
from itertools import zip_longest

O = input()
E = input()

password = ""

for o, e in zip_longest(O, E, fillvalue=""):
    password += o + e

print(password)

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


cont = True
i = 0
s = str()

while i < len(O):
    s += O[i]
    if cont == False:
        break
    s += E[i]
    if i == len(E)-1:
        cont = False
    i += 1
    
print(s)

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

l = [0]*(len(o)+len(e))



for i in range((len(o)+len(e))//2):

	l[i*2] = o[i]
	l[i*2+1] = e[i]

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

print(''.join(l))

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()
No = len(O)
Ne = len(E)
ls = [0]*(No+Ne)
for i in range(No):
  ls[2*i] = O[i]
for i in range(Ne):
  ls[2*i+1] = E[i]

print(*ls, sep ="")

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

Solution (Python):
from sys import stdin

o = stdin.readline().rstrip()
e = stdin.readline().rstrip()

sn = ""
for i in range(len(e)):
    sn += o[i]
    sn += e[i]

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

print(sn)

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

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

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

Solution (Python):
def main():
    O = list(input())
    E = list(input())
    P = []

    for i in range(len(E)):
        P.append(O[i])
        P.append(E[i])

    if len(O) != len(E):
        P.append(O[-1])

    print(''.join(P))


main()

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

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

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

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

Solution (Python):
O = input()
E = input()
Olist = []
Elist = []
S = ''
for i in O:
  Olist.append(i)
for i in E:
  Elist.append(0)
  Elist.append(i)
for i in range(len(Elist)):
  if i % 2 ==0 :
    Elist[i] = Olist[int(i/2)]
for i in range(len(Elist)):
  S = S + Elist[i]
if len(O) > len(E):
  print(S + O[-1])
else:
  print(S)

Solution (Python):
import numpy as np

O=list(input())
E=list(input())
lenOE=len(O)+len(E)

if lenOE%2==1: 
    E+="."

print("".join(np.asarray([O,E]).T.reshape(-1,)[:lenOE]))

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    a=ST()
    b=ST()+" "
    ans = ""
    for i,s in enumerate(a):
        ans += s+b[i]
    ans.replace(" ","")
    print(ans)
if __name__ == '__main__':
    main()

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

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

print(c)

Solution (Python):
a= input()
b = input()
for i in range(len(a)*2):
    if i%2:
        if i//2>=len(b):
            continue
        print(b[i//2],end='')
    else:
        if i//2 >= len(a):
            continue
        print(a[i//2],end='')
print()

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

password = []

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

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

password = ''.join(password)
print(password)

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

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

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

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

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

print(Answer)

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//2]
print(ans)

Solution (Python):

o = input()
e = input()

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

Solution (Python):
O = list(input()[::-1])
E = list(input()[::-1])

S = []
while True:
    if not O: break
    S += O.pop()
    if not E: break
    S += E.pop()
print("".join(S))

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

Solution (Python):
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(inputs):
    O = list(inputs[0])
    E = list(inputs[1])
    O.reverse()
    E.reverse()

    s = []
    for i in range(len(E)):
        s.append(O.pop())
        s.append(E.pop())
    if len(O) != 0:
        s.append(O.pop())
    return ''.join(s)


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(2))
    print(ret)

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

Solution (Python):
O = list(str(input()))
E = list(str(input()))
count = len(O) - len(E)
ans = ''

if count == 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,e=input(),input()
p=''
for i in range(len(o)+len(e)):
    if i%2==0:
        p+=o[i//2]
    else:
        p+=e[(i-1)//2]
print(p)

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

no = len(o)
ne = len(e)
i = 0
oi = 0
ei = 0
s = ''
while i < no+ne:
    if i % 2 != 0 and oi < no:
        s += o[oi]
        oi += 1
    elif i % 2 == 0 and ei < ne:
        s += e[ei]
        ei += 1
    i += 1

print(s)

Solution (Python):

O = input()
E = input()
S = ""
for i in range(len(E)):
    S = S + O[i]
    S = S + E[i]
if len(E) < len(O):
    S = S + O[len(O)-1]
print(S)

Solution (Python):
o=list(input())
e=list(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):
a=input()
b=input()
d=zip(a,b)
e="".join(i[0]+i[1] for i in d)
if len(a)==len(b):
	print(e)
elif len(a)>len(b):
  	print(e+a[-1])
elif len(a)<len(b):
  	print(e+b[-1])