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

ans = list()
for i in range(max(len(O),len(E))):
    try:
        ans.extend([O[i],E[i]])
    except IndexError:
        if len(O) > len(E):
            ans.extend(O[i])
        else:
            ans.extend(E[i])
print(''.join(ans))

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

o = rr()
e = rr()
s = ''
for a, b in itertools.zip_longest(o, e, fillvalue=''):
  s += a + b
print(s)

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

for i in range(len(E)):
    O.insert(2 * i + 1, E[i])

print("".join(O))

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

Solution (Python):
O=input()
E=input()
ans=""
for odd, even in zip(O,E):
    ans=ans+odd+even
if len(O)<len(E):
    ans=ans+E[-1]
elif len(O)>len(E):
    ans=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()
ans=""
for i in range(len(O)):
  try:
    ans+=O[i]+E[i]
  except:
    ans+=O[i]
print(ans)

Solution (Python):
O = input().strip()
E = input().strip()
p = ""
for x in zip(O, E):
    p += x[0]+x[1]
if len(O) != len(E):
    p += O[-1]
print(p)

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

ans = [O[i//2] if i % 2 == 0 else E[i//2] for i in range(len(O)+len(E))]
print(''.join(ans))

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

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

Solution (Python):
import sys


inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())

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

ans =  ""
if len(o) == len(e):
    for c1, c2 in zip(o, e):
        ans += c1 + c2
else:
    for c1, c2 in zip(o[:-1], e):
        ans += c1 + c2
    ans += o[-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):
s= input().strip()
t= input().strip()

ls=len(s)
lt=len(t)
v=''
for i in range(lt):
    v+=s[i]+t[i]
if lt!=ls:
    v+=s[-1]
print(v)

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

def main():
    o = input()
    e = input()
    ans = []
    for i in range(max(len(o), len(e))):
        if i < len(o):
            ans.append(o[i])
        if i < len(e):
            ans.append(e[i])
    print(''.join(ans))

if __name__ == '__main__':
    main()

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

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

print(ans)

Solution (Python):








o = input()
n = input()

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

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

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

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

print("".join(ans))

Solution (Python):
N=input()
M=input()
N=list(str(N))
M=list(str(M))
ans=[]
if len(N)>len(M):
  for i in range(len(N)-1):
    ans.append(N[i])
    ans.append(M[i])
  ans.append(N[-1])
else:
  for i in range(len(N)):
    ans.append(N[i])
    ans.append(M[i])
print("".join(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):
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

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

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

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

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

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

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

print(ans)

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

x = []
for i in range(len(E)):
    x.append(O[i])
    x.append(E[i])
if len(O)!=len(E):
    x.append(O[-1])
s = ''.join(x)
print(s)

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

Solution (Python):
O = list(input())
E = list(input())+['']
print(*[o+e for o,e in zip(O,E)], 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):
from itertools import zip_longest
O = input()
E = input()
print(''.join(S+T for S,T in zip_longest(O,E,fillvalue='')))

Solution (Python):
O,E = input(),input()
ans = ''

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

Solution (Python):
O,E = input(),input()
ans = ''

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

Solution (Python):
O=input()
E=input()
L=list()
for i in range(len(O)+len(E)):
  if i%2==0:
    L.append(O[i//2])
  else:
    L.append(E[(i-1)//2])
print("".join(L))

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

P = ''

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

print(P.rstrip())

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

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

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

for i in range(len(O)+len(E)):
    if i % 2:
        ans += E.pop(0)
    else:
        ans += O.pop(0)

print(ans)

Solution (Python):
O=[x for x in input()]
E=[y for y in input()]

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

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

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

l = [0]*(len(O)+len(E))

l[0::2] = list(O)

l[1::2] = list(E)

print("".join(l))

Solution (Python):
 
o=input()
e=input()
cnt=0
i , j = 0 , 0
a = len(o)
b = len(e)
ans = ''
while i<a or j<b:
	if cnt%2==0:
 		ans = ans+(o[i])
 		i = i+1
 		cnt = cnt+1
	else:
		ans =ans+(e[j])
		j =j+1
		cnt =cnt+1
while i<a:
	ans = ans+(o[i])
	i = i+1
print(ans)

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

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

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

Solution (Python):
o=input()
s=input()
p=[""]*(len(o)+len(s))
for i in range(len(o)):
  p[i*2]=o[i]
for i in range(len(s)):
  p[i*2+1]=s[i]

print("".join(p))

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

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

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

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

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


O = input()
E = input()

for x,y in zip(O,E):
    print(x+y, end="")
if len(O) > len(E):
    print(O[-1])
else:
    print("")

Solution (Python):
from itertools import zip_longest

o=input()
e=input()

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

Solution (Python):
from collections import deque
 
O=input()
E=input()
 
o=deque(O)
e=deque(E)
 
s=''
while True:
  if not e  and not o:
    break
  if o:
    s+=o.popleft()
  if e:
    s+=e.popleft()
    
  
print(s)

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    O = readline().strip()
    E = readline().strip()

    ans = ''.join(O[i // 2] if i % 2 == 0 else E[i // 2] for i in range(len(O) + len(E)))
    print(ans)
    return


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
a = input()
b = input()
s = ""
for i in range(len(a)+len(b)):
    s+=a[0]
    a=a[1:]
    a,b=b,a

print(s)

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

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

print(ans)

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

Solution (Python):
o,e = map(list, open(0).read().split())

ans = ''

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

print(ans)

Solution (Python):


O = str(input())
E = str(input())
P = []
for i in range(len(O)):
    P.append(O[i])
    if i < len(E):
        P.append(E[i])
print(''.join(P))

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 = []
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 = 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):
MM = input()
LL = input()
M = list(MM)
L = list(LL)
kara =[]
a = len(M)
b = len(L)
x = a + b
for i in range(x):
  if i%2==0:
    aa = M.pop(0)
    kara.append(aa)
  else:
    bb = L.pop(0)
    kara.append(bb)
for i in kara:
  print(i,end='')

Solution (Python):
s1 = input()
s2 = input()
s = [ 'a' for _ in range(len(s1) + len(s2))]

s[::2] = s1
s[1::2] = s2

print(''.join(s))

Solution (Python):
o = input()
e = input()
ans = ""
for n1, n2 in zip(o,e) :
    ans += n1
    ans += n2
if len(o) != len(e) :
    ans += o[len(o)-1]
print(ans)

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

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="")
elif len(O) > len(E):
    for i in range(len(E)):
        print(O[i], end="")
        print(E[i], end="")
    print(O[i+1])
else:
    for i in range(len(E)):
        print(O[i], end="")
        print(E[i], end="")
    print(E[i+1])

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

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

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

Solution (Python):
import queue

o = input()
e = input()

odd = list(o)
even = list(e)

answer = []

o_q = queue.Queue()
e_q = queue.Queue()

for i in range(len(odd)):
    o_q.put(odd[i])

for i in range(len(even)):
    e_q.put(even[i])

while not o_q.empty():
    answer.append(o_q.get())
    if e_q.empty():
        continue
    answer.append(e_q.get())

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

Solution (Python):
o=input()
e=input()
mix=[o,e]
ans=[]
for i in range(len(o)+len(e)):
    ans.append(mix[i%2][i//2])
print(''.join(ans))

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):
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())+[""]
o = len(O)
x =[]
for i in range(o):
  ans = O[i] + E[i]
  x.append(ans)

print("".join(x))

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

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

print(ans)

Solution (Python):
e = list(input())
t = list(input())
password = ""
count_e = 0
count_t = 0
for i in range(len(e) + len(t)):
    if i % 2 == 0:
        password += e[count_e]
        count_e += 1
    else:
        password += t[count_t]
        count_t += 1
print(password)

Solution (Python):
o = list(input())
e = list(input())
ans = ''
for i in range(len(e)):
    ans+=o.pop(0)
    ans+=e.pop(0)
if o:
    ans+=o.pop(0)
print(ans)

Solution (Python):
O = list(input())
E = list(input())
lo = len(O)
le = len(E)
if lo > le:
  for i in range(le):
    print(O[i]+E[i],end="")
  print(O[-1])
else:
  for i in range(le):
    print(O[i]+E[i],end="")

Solution (Python):
import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]

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

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

    size = min(len(O), len(E))

    lis = []
    for i in range(size):
        lis.append(O[i] + E[i])

    if len(O) > size:
        lis.append(O[len(E):])
    elif len(E) > size:
        lis.append(E[len(O):])

    return "".join(lis)


if __name__ == '__main__':
    res = solve()
    print(res)

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

    size = min(len(O), len(E))

    res = ""
    for i in range(size):
        res += O[i] + E[i]

    if len(O) > size:
        res += O[len(E):]
    elif len(E) > size:
        res += E[len(O):]

    return res


if __name__ == '__main__':
    res = solve()
    print(res)

Solution (Python):
O = input()
E = input()
if len(O) == len(E):
    for s in zip(O, E):
        print(s[0] + s[1], end='')
    print()
else:
    print(O[0], end='')
    for s in zip(E, O[1:]):
        print(s[0] + s[1], end='')
    print()

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

p = ""
for i in range(len(o) + len(e)):
    if i % 2 == 0:
        p += o[i//2]
    else:
        p += e[i//2]
print(p)

Solution (Python):
from collections import deque
o = deque(list(input()))
e = deque(list(input()))
while e:
    print(o.popleft(), end='')
    print(e.popleft(), end='')

if o:
    print(o.popleft(), end='')
print('')

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

for o, e in zip(O, E):
    a += o + e
if len(O) != len(E):
    a += O[-1]
print(a)

Solution (Python):

o = input()
e = input() + "0"
s = ""
for a, b in zip(o, e[:len(o)]):
    s = s + a + b
print(s.replace("0", ""))

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

O = list(input().rstrip('\n'))
E = list(input().rstrip('\n'))
n = len(O) + len(E)
A = []

for i in range(n):
    if i % 2 == 0:
        A.append(O[i//2])
    else:
        A.append(E[i//2])
ans = "".join(A)
print(ans)

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

print("".join([o + (e if e else "") for (o, e) in zip_longest(O, E)]))

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

ans = ''
for a, b in zip(list(o), list(e)):
    ans += a+b

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

Solution (Python):
O = input()
E = input()
num = len(O) + len(E)
ans = [O[i//2] if i % 2 == 0 else E[i//2] for i in range(num)]
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) == 1:
    ans += O[-1]

print(ans)

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

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

Solution (Python):
def main():
    o = list(input())
    e = list(input())
    s = []

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

if __name__ == '__main__':
    main()

Solution (Python):
O=input()
E=input()
s=''
for i in range(len(O)+len(E)):
  if i%2==0:
    s+=O[i//2]
    continue
  s+=E[i//2]
print(s)

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

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

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

for n in range(len(E)):
  ans.append(O[n])
  ans.append(E[n])

if len(O) != len(E):
  ans.append(O[-1])
  
print("".join(ans))

Solution (Python):
x = input()
y = input()
s = x + y
count = 0
ans = ""
for i in range(len(s)):
    if count%2 == 0:
        ans += s[count//2]
        count += 1
    else:
        ans += s[count//2+len(x)]
        count+=1
print(ans)

Solution (Python):

import sys
from collections import deque, defaultdict
from math import sqrt, factorial





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


t = 1

for case in range(1,t+1):
    ans = solve()




"""

4
1 2
2 4
1 3
3
2 2 4
4 5 6

6
1 2
2 3
3 4
4 5
4 6
3
3 5 6
2 17 31 5 11

"""

Solution (Python):
import sys
sys.setrecursionlimit(500000)

def input():
    return sys.stdin.readline()[:-1]

def mi():
    return map(int, input().split())

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

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]


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



if __name__ == '__main__':
    main()

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()
Ol = len(O)
El = len(E)
alllen = Ol + El
num = 0
num_2 = 0
pw = ""
for i in range(alllen):
  if i % 2 == 0:
    pw+=O[num]
    num+=1
  else:
    pw+=E[num_2]
    num_2+=1
print(pw)

Solution (Python):
from itertools import zip_longest

O = input()
E = input()

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

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

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

print(S)

Solution (Python):
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

o = s()
e = s()

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

for (a, b) in zip(o, e):
    print(f'{a}{b}', end='')
if len(o) > len(e):
    print(o[-1], end='')
print()

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

N=len(O)
M=len(E)
ans=""
for i in range(N):
    ans+=O[i]
    if N-M==1 and i==M:
        break
    ans+=E[i]
print(ans)

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

a_len = len(a)
b_len = len(b)

huku = []

for i in range(a_len):
    if a_len != b_len and i==a_len-1:
        huku.append(a[i])
        break
    else:
        huku.append(a[i])
        huku.append(b[i])
for i in range(len(huku)):
    print(huku[i],end="")

Solution (Python):


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

ans = ''

if len(O) - len(E) == 1:
    E.append('')

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

print(ans)

Solution (Python):

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

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

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

print(pw)

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

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

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

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

if len(o) != len(e):
    e += [""]

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

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

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

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

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

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

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

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

ans = []
n = 0
while n < len(o)+len(e):
  if n % 2 == 0:
    ans.append(o[n//2])
  else:
    ans.append(e[n//2])
  n += 1
print(*ans, sep='')

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

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


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

Solution (Python):
def main():
    O = input()
    E = input()
    last = ""
    if len(O) > len(E):
        last = O[-1]
        O = O[:-1]

    ans = ""
    for s1, s2 in zip(O, E):
        ans += s1 + s2

    ans += last
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
print("".join(sum(zip(input(),input()+" "),())))

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

for o,e in zip(O,E):
  a+=o+e

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

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

Solution (Python):
import sys
O = str(input())
E = str(input())


O_array = list(O)
E_array = list(E)


if not O.islower() or not E.islower():
    sys.exit()
if len(O) < 0 or len(O) > 50 or len(E) < 0 or len(E) > 50:
    sys.exit()
diff_length = len(O) - len(E)
if not (diff_length == 0 or diff_length == 1):
    sys.exit()

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

Solution (Python):
o=input()
e=input()
ans=[]
for i in range(max(len(o),len(e))):
  try:
    ans.append(o[i])
    ans.append(e[i])
  except:
    break
print("".join(ans))

Solution (Python):
o = list(str(input()))
x = list(str(input()))
ln = []
for i in range(len(o)):
    ln.append(o[i])
    if len(x) > i:
        ln.append(x[i])
print(''.join(ln))

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

ans = ''.join(''.join(s) for s in zip(O, E))
ans += O[-1] if len(O) - len(E) == 1 else ''
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()
txt = ""
if len(O) == len(E):
    for o,e in zip(O,E):
        txt += o + e
else:
    for o,e in zip(O,E):
        txt += o + e
    txt += O[-1]
print(txt)

Solution (Python):
print("".join(sum(zip(input(),input()+" "),())))

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

if len(O) != len(E):
    for i in range(len(O)-1):
        pw += O[i]+E[i]
        if i == len(O)-2:
            pw += O[len(O)-1]
else:
    for j in range(len(O)):
        pw += O[j]+E[j]

print(pw)

Solution (Python):
s=input()
t=input()
k=[]
for i in range(len(t)):
    k.append(s[i])
    k.append(t[i])
if len(s)>len(t):
    k.append(s[len(s)-1])
print("".join(k))

Solution (Python):






O = input()
E = 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])
print("".join(password))

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

Solution (Python):
a,b=input(),input();
length = len(a)+len(b)
result = []
count1 = 0
count2 = 0
for i in range(length):
  if i % 2 == 0:
    try:
      result.append(a[count1])
      count1 += 1
    except:
      continue
  else:
    try:
      result.append(b[count2])
      count2 += 1
    except:
      continue
print(''.join(result))

Solution (Python):
O=input()
E=input()
ans=[]
for m in range(len(O)+len(E)):
    ans.append('k')
for i in range(len(O)):
    ans[2*i]=O[i]
for j in range(len(E))   :
    ans[2*j+1]=E[j]

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

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

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

list = []

if len(O)==len(E):
    for i in range(len(O)):
        list.append(O[i])
        list.append(E[i])

else:
    for i in range(len(E)):
        list.append(O[i])
        list.append(E[i])
    list.append(O[-1])

L="".join(list)
print(L)

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

ans += O[len(O)-1]
try:
    ans += E[len(O)-1]
except IndexError:
    pass
print(ans)

Solution (Python):


def main():
    O = input()
    E = input()
    s = []
    for i in range(len(E)):
        s.append(O[i])
        s.append(E[i])
    if len(O) - len(E):
        s.append(O[-1])
    print(''.join(s))


if __name__ == '__main__':
    main()

Solution (Python):
O=input()
E=input()
ans=[]
j=0
k=0
for i in range(len(O)+len(E)):
    if i%2==0:
        ans.append(O[k])
        k+=1
    else:
        ans.append(E[j])
        j+=1
print(*ans,sep="")

Solution (Python):
from itertools import zip_longest
o = input()
e = input()
for i, j in zip_longest(o,e,fillvalue=''):
  print(i+j, end='')

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

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

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

k = input()
p = input()
d = len(k)
f = len(p)
g=""
diff = abs(d-f)

if d>f :
     d = d-diff
     g = k[d:len(k)]
   
else:
    f = f-diff
    g=p[f:len(p)]


r=""
i = 0
for i in range(d):
    r += "".join(k[i]+p[i])
    
    
print(r+g)