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

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

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

print(ans)

Solution (Python):
o = str(input())
e = str(input())
x = []
if len(o) == len(e):
  for i in range(len(o)):
    x.append(o[i]+e[i])
else:
  for i in range(len(e)):
    x.append(o[i]+e[i])
  x.append(o[-1])
print(*x,sep="")

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

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-1)//2]

print(ans)

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

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

Solution (Python):
def main():
    o=list(input())
    e=list(input())
    ans = ''
    for i,j in zip(o,e):
        ans += i
        ans += j
    if len(o)-len(e) == 1:
        ans += o[-1]
    print(ans)
if __name__ == '__main__':
    main()

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

Solution (Python):
O=input()
E=input()
li=[]
for i in range(len(O)):
  li.append(O[i])
  try:
    li.append(E[i])
  except:
    continue
print("".join(li))

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

s = ""

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

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

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

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

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

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

Solution (Python):
a = list(input())
b = list(input())
ans = []
if len(a) == len(b):
    for i in range(len(a)):
        ans.append(a[i])
        ans.append(b[i])
elif len(a) > len(b):
    for i in range(len(b)):
        ans.append(a[i])
        ans.append(b[i])
    ans.append(a[-1])

print(''.join(ans))

Solution (Python):

O = input()
E = input()

S = ''
for o, e in zip(O, E):
    S = S + o + e
if len(O) > len(E):
    print(S + O[-1])
else:
    print(S)

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

for s,t in zip(O,E):
  z+=s
  z+=t
  
if len(E)<len(O):
  z+=O[-1]

print(z)

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):
odd = input()
even = input()
ans = ''
for i in range(0, len(odd)):
	ans = ans + odd[i]
	if i != len(even):
		ans = ans + even[i]
print(ans)

Solution (Python):
a = input()
b = input()
ans = ""
count = 0
while True:
  if count == len(a):
    print(ans)
    exit()
  ans += a[count]
  if count == len(b):
    print(ans)
    exit()
  ans += b[count]
  count += 1

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

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

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

print(out)

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

for i in range(len(o)+len(e)):
  if i%2==0:
    out += o[int(i/2)]
  elif i%2!=0:
    out += e[int(i/2)]

print(out)

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()
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()
print(''.join([a + b for a, b in zip(o, e)]) + (o[-1] * (len(o + e) % 2)))

Solution (Python):
a=""
s,t=input(),input()
for i in range(len(s)):
  a+=s[i]
  if i<len(t):a+=t[i]
print(a)

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    a, b, c = LI()
    if b - a == c - b:
        print("YES")
    else:
        print("NO")
    return


def B():
    o = S()
    e = S()
    for i in range(len(e)):
        print(o[i] + e[i], end="")
    if len(e) != len(o):
        print(o[-1], end="")
    print()
    return


def C():
    return


def D():
    return


if __name__ == '__main__':
    B()

Solution (Python):

from collections import defaultdict, Counter

def main():
    a = list(input())
    b = list(input())

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

    print("".join(pw))

    
    
    
    
    
    
    
    


if __name__ == "__main__":

    main()

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

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

    print("".join(pw))


if __name__ == "__main__":

    main()

Solution (Python):
O = list(input())
E = list(input())
res = ''
iter = 0
while len(O) != 0 or len(E) != 0:
    if len(O) > 0:
        res += O.pop(0)
    if len(E) > 0:
        res += E.pop(0)
    iter += 1
print(res)

Solution (Python):
o=input()
e=input()
s=[0]*(len(o)+len(e))
for i in range(len(o)):s[2*i]=o[i]
for i in range(len(e)):s[2*i+1]=e[i]
print(*s,sep='')

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

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

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

ans = ""

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

print(ans)

Solution (Python):
a = input()
b = input()
c = ""
for i in range(max(len(a), len(b))):
    if i < len(a):
        c += a[i]
    if i < len(b):
        c += b[i]
print(c)

Solution (Python):
s = input()
s2 = input()
ans = ""
for i in range(0,max(len(s),len(s2))):
  if i < len(s):
    ans += s[i]
  if i < len(s2):
    ans += s2[i]
print(ans)

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

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

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

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

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

Solution (Python):


def main(O, E):
    A = []
    if(len(O)==len(E)):
        for i in range(len(O)):
            A.append(O[i])
            A.append(E[i])
        print("".join(A))
    else:
        for i in range(len(E)):
            A.append(O[i])
            A.append(E[i])
        A.append(O[-1])
        print("".join(A))  
    
if __name__ == '__main__':
    O = input()
    E = input()
    
    main(O, E)

Solution (Python):



o = input()
e = input()

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

Solution (Python):

O = input()
E = input()

ans = ""
o = 0
e = 0

for i in range(len(O)+len(E)):

    if i % 2 == 0:

        ans += O[o]
        o += 1

    else:

        ans += E[e]
        e += 1

print (ans)

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

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

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

Solution (Python):
o=input()
e=input()
t=""
for a,i in enumerate(o):
    t+=i
    if a+1<=len(e): t+=e[a]
print(t)

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

print(a)

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

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

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

while True:
    if len(O) == 0 and len(E) == 0:
        break;
    if len(O) > 0:
        password.append(O.pop(0))
    if len(E) > 0:
        password.append(E.pop(0))

print("".join(password))

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

while True:
    if len(O) == 0 and len(E) == 0:
        break;
    if len(O) > 0:
        password.append(O.pop(0))
    if len(E) > 0:
        password.append(E.pop(0))

print("".join(password))

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

ans = ""

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

print(ans[4:-4])

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

Solution (Python):
from math import floor
a = input()
b = input()
c = ""

for i in range(len(a)+len(b)):
  if i%2==0:
    c+=a[floor(0.5*i)]
  else:
    c+=b[floor(0.5*i)]
else:
  print(c)

Solution (Python):

import sys
sys.setrecursionlimit(300000)


def solve(O: str, E: str):
    ret = [None] * (len(O) + len(E))
    for i in range(len(O)):
        ret[i * 2] = O[i]
    for i in range(len(E)):
        ret[i * 2 + 1] = E[i]
    print(''.join(ret))
    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()
E = 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 = input()
e = input()

lo = len(o)
le = len(e)

ans = ''

if lo != le:
    e += '/'

for i in range(lo):
    ans += o[i] + e[i]

if lo == le:
    print(ans)
else:
    print(ans[:-1])

Solution (Python):
from sys import stdin
O,E = map(lambda x: [x2 for x2 in x],stdin.read().splitlines())
if len(O) - len(E) == 1:
  E.append("")
print("".join([o+e for o,e in zip(O,E)]))

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

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

Solution (Python):
O = list(input())
E = list(input())
i = 1
for x in E:
  O.insert(i,x)
  i+=2
print(''.join(O))

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

Solution (Python):


O, E = list(input()), list(input())
mrg = []

for i in range(len(E)):
    mrg.append(O[i])
    mrg.append(E[i])
    
if len(O) > len(E):
    mrg.append(O[-1])
    
for j in range(len(mrg)):
    print(mrg[j], end = "")

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

Solution (Python):
odd = input()
even = input()
for i in range(len(even)):
  print(odd[i],end="")
  print(even[i],end="")
if len(odd) > len(even):
  print(odd[-1])

Solution (Python):

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

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):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

O = s()
E = s()

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

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

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

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

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

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

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

Solution (Python):
o = input().rstrip()
e = input().rstrip()
 
ans = ''
for l1, l2 in zip(o, e):
  ans = ''.join([ans, l1, l2])
 
if len(o) > len(e):
  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(str(input()))
e = list(str(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):
def abc():
    o = list(input().rstrip())
    e = list(input().rstrip())
    if len(o) > len(e):
        e.append('')
    password = ''
    for _o, _e in zip(o, e):
        password += _o + _e
    print(password)


abc()

Solution (Python):
O=input()
E=input()
OE=[O,E]
password=""
for idx in range(len(O)+len(E)):
    password+=(OE[idx % 2][int(idx/2)])
print(password)

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 bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
import string

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

sys.setrecursionlimit(2147483647)
INF = float("inf")


import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
import string

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

sys.setrecursionlimit(2147483647)
INF = float("inf")























O, E = [sys.stdin.readline().rstrip() for _ in range(2)]
ans = ''
for i in range(len(O)):
    ans += O[i]
    if i < len(E):
        ans += E[i]

print(ans)

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

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

if len(O) > len(E):
    for i in range(len(E)):
        print(O[i],end="")
        print(E[i],end="")
    print(O[i+1])
elif len(O) < len(E):
    for i in range(len(O)):
        print(E[i],end="")
        print(O[i],end="")
    print(O[i+1])
else:
    for i in range(len(O)):
        print(O[i],end="")
        print(E[i],end="")

Solution (Python):
o=input()
e=input()
ans=''
if len(o)-len(e)==1:
    o1=o[-1]
    o=o[:-1]
else:
    o1=''

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

print(ans)

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

for x,y in zip(a,b):
    print(x+y,end="")

if len(a)>len(b):
    print(a[len(a)-1])
elif len(a)<len(b):
    print(b[len(b)-1])

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

answer = ""
for i in range(len(O)) :
    if (len(O) > len(E)) and ((i+1) == len(O)) :
        answer += O[i]
    else :
        answer += O[i]
        answer += E[i]

print(answer)

Solution (Python):
o = input()
e = input()
if len(o) == len(e):
    for i,j in zip(o,e):
        print(i + j, end='')
else:
    print(o[0], end='')
    for i, j in zip(o[1:],e):
        print(j+i, end='')

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

Solution (Python):
from itertools import zip_longest

o = input()
e = input()
ans = ""
for i,j in zip_longest(o,e,fillvalue=""):
  ans += i
  ans += j
print(ans)

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

for i in range(len(O) + len(E)):
    if i == 0 or i % 2 == 0:
        ans.append(O[cnt])
    else:
        ans.append(E[cnt])
        cnt += 1

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=ans+o[-1]

print(ans)

Solution (Python):
S = input()
T = input()

answer = ''
for s,t in zip(S,T):
  answer += s
  answer += t
  
if len(S) > len(T):
  answer += S[-1]

print(answer)

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

print(ans+o[l:]+e[l:])

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

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

s = []
if len(O)>len(E):
  for a,b in zip(O[:-1],E):
    s.append(a)
    s.append(b)
  s.append(O[-1])
else:
  for a,b in zip(O,E):
    s.append(a)
    s.append(b)

print(''.join(s))

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

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

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

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

for i,j in enumerate(e):
    o.insert(1+2*i,j)
print("".join(o))

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

answer = []
for o, e in zip(O.copy(), E.copy()):
  answer.append(o)
  answer.append(e)
  O.pop(0)
  E.pop(0)

if len(O) == 0 and len(E) == 0:
  print(''.join(answer))
else: 
  answer.append(O[0])
  print(''.join(answer))

Solution (Python):
O  = list(input())
E = list(input())
ans = []
size_o = len(O)
size_e = len(E)

if size_o - size_e == 0 :
    for i in range(size_o):
        ans.append(O[i])
        ans.append(E[i])
    print("{}".format("".join(ans)))
else :
    for i in range(size_e):
        ans.append(O[i])
        ans.append(E[i])
    ans.append(O[-1])
    print("{}".format("".join(ans)))

Solution (Python):
from sys import stdin
from itertools import zip_longest
O = (stdin.readline().rstrip())
E = (stdin.readline().rstrip())
ans=""
for i,j in zip_longest(list(O),list(E),fillvalue=""):
    ans = ans + i + j
print(ans)

Solution (Python):
a=input()
b=input()
l1=len(a)
l2=len(b)
if l1==l2:
  for i in range(l1):
    print(a[i]+b[i],end="")
else:
  for i in range(l2):
    print(a[i]+b[i],end="")
  print(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()
for i in range(len(O)):
    print(O[i], end="")
    if i < len(E):
        print(E[i], end="")

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

print(ans+o[l:]+e[l:])

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

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

l = len(O)
L = len(E)
s = ''

if l == L:
    for i in range(l):
        s = s + O[i] + E[i]
    print(s)
else:
    for i in range(L):
        s = s + O[i] + E[i]
    s += O[-1]
    print(s)

Solution (Python):




o = input()
e = input()
str = ""

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

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


print(str)

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

Solution (Python):


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

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

if __name__ == "__main__":
    solve()

Solution (Python):
O = input()
E = input()
length = len(O)+len(E)
ans = [""]*length

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

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

Solution (Python):
o = list(input())
e = list(input())
z = int(max(len(o),len(e)))
for i in range(z):
    if o[i:i+1]:
        print(o[i],sep='',end='')
    if e[i:i+1]:
        print(e[i],sep='',end='')
print('')

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

Solution (Python):
s1 = input()
s2 = input()

ans = ""
for i in range(len(s1)+len(s2)):
  if i % 2 == 0:
    ans += s1[i//2]
  else:
    ans += s2[i//2]
print(ans)

Solution (Python):
odd = input()
even = input()
password = ""
o_index = 0
e_index = 0

while True:
	if not o_index == len(odd):
		password+= odd[o_index]
		o_index+=1

	if not e_index == len(even):
		password+= even[e_index]
		e_index+=1
	
	else:
		break

	
print(password)

Solution (Python):
odd = input()
even =input()
odd_list = []
even_list = []

for i in odd:
    odd_list.append(i)
for j in even:
    even_list.append(j)
even_list.append("")

for i in range(len(odd_list)):
    print(odd_list[i],end = "")
    print(even_list[i],end = "")

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

tail = len(O) - len(E)

print("".join((x + y for x, y in zip([O, O[:-1]][tail], E))) + ["", O[-1]][tail])

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

Solution (Python):
O, E = input(), input() + " "
print("".join(o + e for o, e in zip(O, E)))

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+O[-1])
else:
    print(ans)

Solution (Python):
o = input()
e = input()
oe = "".join([i + j for i, j in zip(o,e+"\n")])
print(oe)

Solution (Python):
import itertools

O = input()
E = input()

for o, e in itertools.zip_longest(O, E):
    print(o, sep='', end='')
    if e is not None:
        print(e, sep='', end='')
print()

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=list(input())
e=list(input())
re=""
if len(o)==len(e):
    for i in range(len(o)):
        o[i]+=e[i]
    for j in range(len(o)):
        re+=o[j]
    print(re)
elif len(o)>len(e):
    for i in range(len(o)-1):
        o[i]+=e[i]
    for j in range(len(o)):
        re+=o[j]
    print(re)
else:
    for i in range(len(o)):
        o[i]+=e[i]
    for j in range(len(o)):
        re+=o[j]
    re+=e[len(e)-1]
    print(re)

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

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

Solution (Python):
o = input().strip()
e = input().strip()
for i, c in enumerate(o):
    print(c, end='')
    if i < len(e):
        print(e[i], end='')

print()

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

passwd = "".join([O[i] + E[i] for i in range(min(len(O), len(E)))])
if len(O) > len(E):
    passwd += O[-1]
print(passwd)

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

Solution (Python):
print(''.join([o+e for o,e in zip(input(), input()+'\n')]))

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math

mod = 10**9+7

O = str(input())
E = str(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):
from sys import stdin
O = list(stdin.readline().rstrip())
E = list(stdin.readline().rstrip())
ans = []
diff = len(O)-len(E)
for o, e in zip(O, E):
    ans.append(o+e)
if diff == 1:
    ans.append(O[-1])
elif diff == -1:
    ans.append(E[-1])
print(''.join(ans))

Solution (Python):
o = input()
e = input()
O = len(o)
E = len(e)

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

if O < E:print(e[-1])
elif O > E:print(o[-1])
else:print()

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


string = ""
for i in range(len(b)):
    string = string+(a[i])
    string = string+(b[i])
if len(a)>len(b):
    string+= a[-1]

print(string)

Solution (Python):
o=str(input())
e=str(input())
ans=""
i=0
while len(ans)<len(o)+len(e):
    ans+=o[i]
    if i<len(e):
        ans+=e[i]
    i+=1
 
print(ans)

Solution (Python):
o=str(input())
e=str(input())
ans=""
i=0
while len(ans)<len(o)+len(e):
    ans+=o[i]
    if i<len(e):
        ans+=e[i]
    i+=1

print(ans)

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

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

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

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

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

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