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):
odd = list(input())
even = list(input()) + list([''])

for i, j in zip(odd, even):
  print(i, j, sep = '', end = '')

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

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

o = input()
e = input()

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

Solution (Python):
def test():
    o = input()
    e = input()
    s = ""
    k = 0; j = 0
    for i in range(len(o)+len(e)):
        if i % 2 == 0:
            s += o[j]
            j += 1
        else:
            s += e[k]
            k += 1
    print(s)


if __name__ == "__main__":
    test()

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

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

Solution (Python):
O, E = list(input()), list(input())
password = ''.join([o + e for o, e in zip(O, E)])
if len(O) > len(E):
    password += O[-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 = list(input())
E = list(input())+['']
for x,y in zip (O,E):
    print(x+y,end='')

Solution (Python):
from itertools import zip_longest
O = input()
E = input()
ans = ""
for o, e in zip_longest(O, E, fillvalue=""):
  ans += (o + e)
print(ans)

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

ans = ''

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


print(ans)

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

Solution (Python):
O=input();E=input()+' ';print(*[a+b for a,b in zip(O,E)],sep='')

Solution (Python):
O=input()
E=input()+' '
print(*[a+b for a,b in zip(O,E)], sep='')

Solution (Python):
def main():
    A = list(input())
    B = list(input())
    pwd = ""
    while A and B:
        pwd += A.pop(0)
        pwd += B.pop(0)
    if A:
        pwd += A.pop(0)
    return pwd

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

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

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

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

Solution (Python):
import copy

O, E = [list(input()) for _ in range(2)]

s=copy.deepcopy(E)

for i in range(len(O)):
    s.insert(i*2,O[i])
  
print(''.join(s)  )

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

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

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

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

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

Solution (Python):
a=input()
b=input()
x=''
while(len(a)>0):
  x+=a[:1]
  a=a[1:]
  x+=b[:1]
  b=b[1:]
print(x)

Solution (Python):
o = list(input())
e = list(input())
e.append("")
for i,x in zip(o,e):
    print(i+x,end="")

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

Solution (Python):

import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

    print(ans)


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
O = list(input())
E = list(input())
tail = ""
if len(O) < len(E):
    tail = E[-1]
elif len(E) < len(O):
    tail = O[-1]
ans = ""
for x,y in zip(O,E):
    ans += x + y
print(ans+tail)

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

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

if len(O) != len(E):
    print (O[-1], end = '')

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 = [""] * (len(o) + len(e))
ans[0] = "a"

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

if len(o) != len(e):
    ans[len(e)*2] = 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 = input()
E = input()

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

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

ans = []
for i in range(len(a)):
    ans.append(a[i])
    if i < len(b):
        ans.append(b[i])
print(''.join(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
print("".join(sum(zip_longest(input(), input(), fillvalue=""), tuple())))

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

Solution (Python):
A = input()
B = input()
S = list(A)
for i in range(len(B)):
  S.insert(i*2+1,B[i])
print(''.join(map(str, S)))

Solution (Python):
O, E = [list(input()) for _ in range(2)]
[print("{}{}".format(i, j), end="") for i, j in zip(O, E)]
print(O[-1]) if len(O) > len(E) else print()

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

print(x)

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

Solution (Python):
from itertools import zip_longest

def resolve():
    odd = input()
    even = input()

    for o, e in zip_longest(odd, even):
        if o is None:
            o = ""
        elif e is None:
            e = ""
        print(o+e, end="")
    else:
        print()

if __name__ == '__main__':
    resolve()

Solution (Python):
print(''.join(map(''.join,zip(*open(0)))))

Solution (Python):
o = input()
e = input()
a = [0] * (len(o)+len(e))
for i in range(len(o)):
  a[2*i] = o[i]
for j in range(len(e)):
  a[2*j+1] = e[j]
print(''.join(a))

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

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

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()
pw = []
for i in range(len(E)):
    pw.append(O[i])
    pw.append(E[i])
if len(O)!=len(E):
    pw.append(O[-1])
print(''.join(pw))

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

Solution (Python):
str1 = list(input())
str2 = list(input())
ans = []
for i in range(len(str1)):
    ans.extend(str1[i])
    if len(str2) != len(str1) and i == len(str1) - 1:
        break
    ans.extend(str2[i])
print("".join(ans))

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

if len(O) > len(E):
    E.append("")

print("".join(o+e for o, e in zip(O, E)))

Solution (Python):
O = input()
E = input()
L = []
for i in range(len(O)):
  L.append(O[i])
  if i < len(E):
    L.append(E[i])
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()

for o,e in zip(O,E):
  print('{}{}'.format(o,e),end='')
if len(E)<len(O):
  print(O[-1])

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

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

Solution (Python):
O, E = [input() for i in range(2)]
ans = ''
if len(O) > len(E):
    E += "Z"
    for i, j in zip(O, E):
            ans += i
            ans += j
    print(ans[0:-1])
else:
    for i, j in zip(O, E):
            ans += i
            ans += j
    print(ans)

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

Solution (Python):
o = input()
e = input()
l = len(o) + len(e)
ans = ''
for i in range(len(e)):
    ans += o[i]
    ans += e[i]
if l%2 == 1:
    ans += 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=list(input())
e=list(input())
tmp=""
n=len(o)
if len(o)==len(e):
  for i in range(n):
    tmp+=o[i]+e[i]
else:
  for i in range(n):
    tmp+=o[i]
    if i < n-1:
      tmp+=e[i]
print(tmp)

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

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

len_o=len(O)
len_e=len(E)
if len_o < len_e:
  s+=E[len_o:]
elif len_o > len_e:
  s+=O[len_e:]
  
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()
for i in range(len(o)+len(e)):
    if i%2 == 0:
        print(o[int(i/2)],end='')
    else:
        print(e[int(i/2)],end='')
print(sep='')

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

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

for x,y in zip(O,E):
    print(x,y,sep="",end="")

Solution (Python):


import numpy as np

def resolve():
    O = input()
    E = input()
    ans = ""
    for i in range(len(O)):
        ans += O[i]
        if i < len(E):
            ans += E[i]
    print(ans)

if __name__ == "__main__":
    resolve()

Solution (Python):


O = input()
E = input()

length = len(O) + len(E)

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

if length % 2:
    print(O[-1])

Solution (Python):
odd=input()
even=input()
for a,b in zip(odd,even):
    print(a+b,end='')
if len(odd)>len(even):
    print(odd[-1])
else:
    print()

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

Solution (Python):
o, e = [input().rstrip() for i in range(2)]
lst = []
for i in range(len(o)):
    print(o[i], end='')

    if i + 1 > len(e):
        print()
        break
    else:
        print(e[i], end='')

Solution (Python):
o, e = [input().rstrip() for i in range(2)]
lst = []
for i in range(len(o)):
    print(o[i], end='')

    if i + 1 > len(e):
        print()
        break
    else:
        print(e[i], end='')

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

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

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

import sys
INF = float("inf")


def solve(O: str, E: str):
    ans = ""
    for o, e in zip(O, E):
        ans += o+e
    if len(O)-len(E) == 1:
        ans += O[-1]
    print(ans)

    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):
o=list(input())
e=list(input())+[""]
for x,y in zip(o,e):print(x+y,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 = input()
e = input()
s = ""
for i in range(len(o)):
    s += o[i]
    s += e[i] if i < len(e) else ""
print(s)

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

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

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

for x,y in zip(O,E):
  print(x+y, end = "")

Solution (Python):
import sys
from fractions import gcd
import bisect
 
stdin = sys.stdin
 
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
s = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

o = ns()
e = ns()
if len(o) - len(e) == 0:
        for oi, ei in zip(o, e):
                print(oi + ei, end='')
else:
        for oi, ei in zip(o[:-1], e):
                print(oi + ei, end='')
        print(o[-1], end='')

Solution (Python):
O = list(input())
E = list(input())
x = []
for i in range(0,len(E)):
  x.append(O[i])
  x.append(E[i])
  
if len(O)>len(E):
  x.append(O[-1])
    
print(''.join(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()
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):
A=input()
B=input()
s=""
if len(A)==len(B):
  for i in range(len(A)):
    s+=A[i]+B[i]
else:
  for i in range(len(B)):
    s+=A[i]+B[i]
  s+=A[-1]
print(s)

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

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

ans = []
if len(o) == len(e):
    for i in range(len(e)):
        ans.append(o[i])
        ans.append(e[i])
else:
    ans.append(o[0])
    for i in range(len(e)):
        ans.append(e[i])
        ans.append(o[i+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):
a=list(input())
b=list(input())+[""]
for x,y in zip(a,b):
  print(x+y,end='')

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

print('')

Solution (Python):

import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 




 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    O = input()
    E = input()
    
    tmp = len(E)
    ind = 0
    
    ans = ""
    for i,val in enumerate(O):
        ans += val
        ind = i
        if tmp > i:
            ans += E[i]
        
    print(ans)
    
    
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):
import sys
input=sys.stdin.readline

o = input().strip()
e = input().strip()
ans = ""
for i,c in enumerate(o):
    ans += c
    if i < len(e):
        ans += e[i]
print(ans)

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

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

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

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

Solution (Python):


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

Solution (Python):
o,e=map(str,open(0).read().split())
for i in range(len(o)):
  print(o[i],end="")
  if i==len(o)-1 and len(o)>len(e):
    break
  else:
    print(e[i],end="")

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

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

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

print(ans)

Solution (Python):
o=list(input())
e=list(input())
pw=[]
if len(o)-len(e)==0:
  for i in range(len(o)):
    pw.append(o[i]+e[i])
else:
  for i in range(len(o)-1):
    pw.append(o[i]+e[i])
  pw.append(o[len(o)-1])
print(*pw,sep='')

Solution (Python):
O = list(input())
E = list(input())
ans = ""
while O or E:
  try:
    ans += O.pop(0)
    ans += E.pop(0)
  except IndexError:
    pass
print(ans)

Solution (Python):
o = list(input())
e = list(input())
r = ''
for x in range(len(e)):
    r = r + o[x] + e[x]
if len(o) != len(e):
    r = r + o[-1]

print(r)

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

if len(o) == len(e):
    print(o[len(o)-1], end="")
    print(e[len(e)-1])
else:
    print(o[len(o)-1])

Solution (Python):
o = input()
e = input()
ans = ''
n = len(o) + len(e)
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()
password = []
if (len(O)+len(E))%2 != 0:
    for i in range(len(O)):
        password.append(O[i])
        if i == (len(O)-1): break
        password.append(E[i])
else:
    for i in range(len(E)):
        password.append(O[i])
        password.append(E[i])


print(*password, sep='')

Solution (Python):

o = input() + ' '
e = input() + ' '
x = list(map(lambda a,b: (a+b), o, e))
x = ''.join(x)
print(x.strip())

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

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

Solution (Python):
a=list(input())
b=list(input())+[""]

for c,d in zip(a,b):print(c+d,end="")

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

ans = O[:]
for i in range(len(O)):
    try:
        ans.insert(2*i+1, E[i])
    except:
        break
print("".join(ans))

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

Olen = len(O)
Elen = len(E)

s = ""
for i in range( max(Olen, Elen) ):
    oc = O[i] if i < Olen else ""
    ec = E[i] if i < Elen else ""
    s += oc+ec

print(s)

Solution (Python):
o, e = [input() for _ in range(2)]
print(''.join(x+y for x, y in zip(o, e+" ")))

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

try:
    for i in range(len(o)):
        ans += o[i]
        ans += e[i]
except IndexError:
    pass

print(ans)

Solution (Python):
o = input()
e = input()
print(''.join(a+b for a, b in zip(o, e)), end='')
print(o[-1] if len(o) > len(e) else '')

Solution (Python):
o=input()
e=input()+" "
x=""
for i in range(len(o)):
  x=x+o[i]+e[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 x,y in zip(o,e): print(x+y,end='')

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

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

Solution (Python):
o=input()
e=input()
l=[o[i]+e[i] for i in range(len(e))]
if len(o)>len(e):
    l.append(o[-1])
print(*l,sep='')

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
o=input()
e=input()
print(''.join(o[i]+e[i:i+1] for i in range(len(o))))

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

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

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

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

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

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


print(*arr, sep='')

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

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

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

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

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

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

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

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


o = list(input()[:-1])
e = list(input()[:-1])

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

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

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

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 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):
I=input
for i,j in zip(I(),I()+" "):print(i+j,end="")

Solution (Python):
O = input()
E = input()
tmp = max(len(O), len(E))
ans = ''
for i in range(tmp):
    if len(O) - 1 >= i and len(E) - 1 >= i:
        ans += O[i] + E[i]
    elif len(O) - 1 < i and len(E) - 1 >= i:
        ans += E[i]
    elif len(O) -1 >= i and len(E) - 1 < i:
        ans += O[i]

print(ans)

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

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

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

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

password = ''

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


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_str = ''
for o_one, e_one in zip(o, e):
    ans_str = ans_str + o_one + e_one

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

print(ans_str)

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 = ""
cnt = 0
for o,e in zip(O,E):
    cnt+=1
    ans += o
    ans += e
if len(O) != len(E):
    ans += O[-1]
print(ans)

Solution (Python):
O = input()
E = input()
count = 1
while count <= len(O)+len(E):
    if count % 2 == 1:
        print(O[count//2],end="")
    else:
        print(E[count//2-1],end="")
    count += 1

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

Solution (Python):
O = input()
E = input()
len_o = len(O)
len_e = len(E)
ans = ''
for i in range(len_e):
  ans += O[i] + E[i]
if len_o > len_e:
  ans += O[-1]
print(ans)

Solution (Python):



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

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

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

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

Solution (Python):
pw=[input() for i in range(2)]
length=len(pw[0])
full_pw=[]
i=0
while i < length:
    full_pw.append(pw[0][i])
    if i <=len(pw[1])-1:
        full_pw.append(pw[1][i])
    i+=1

print(*full_pw,sep='')

Solution (Python):
from itertools import zip_longest

o = input()
e = input()

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

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

Solution (Python):

S1 = []
S2 = []
S1 = input()
S2 = input()

nL1 = len(S1)
nL2 = len(S2)

nN = nL1 + nL2

for i in range(nN):
  nFlag = i
  nFlag &= 1
  if i == 0:
    nTmp = 0
  else:
    nTmp = i // 2
  if nFlag == 0:
    print(S1[nTmp], end='')
  else:
    print(S2[nTmp], end='')

print('')

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

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

Solution (Python):
def main():
    O = input()
    E = input()
    if len(O) - len(E) == 0:
        ans = ''
        for o, e in zip(O, E):
            ans += o + e
    else:
        ans = O[0]
        for o, e in zip(O[1:], E):
            ans += e + o
    print(ans)


main()

Solution (Python):

import sys, math, fractions, itertools


def solve(O: str, E: str):
    A = [''] * (len(O) + len(E))
    for i in range(len(A)):
        if i % 2 == 0:
            A[i] = O[i//2]
        else:
            A[i] = E[(i-1)//2]
    print(''.join(A))
    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):
O = input().rstrip('\n')
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)