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

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

Solution (Python):
O = list(input())
E = list(input())
flag = 0
if len(O) != len(E) :
    flag += 1
answer = ""
if flag == 0 :
    for i in range(len(O)) :
        answer += O[i]
        answer += E[i]
else :
    for i in range(len(E)) :
        answer += O[i]
        answer += E[i]
    answer += O[-1]
print(answer)

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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

if __name__ == '__main__':
    main()

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 = input()
e = input()
a = []
for i in range(max(len(o),len(e))):
    try:
        a.append(o[i])
        a.append(e[i])
    except:
        pass
print("".join(a))

Solution (Python):
S=[input() for i in range(2)]
if len(S[0])>len(S[1]):
    L=len(S[0])-1
else:
    L=len(S[0])
for i in range(L):
    print(S[0][i]+S[1][i],end='')
if len(S[0])>len(S[1]):
    print(S[0][-1])

Solution (Python):
O = list(input())
E = list(input())
while True:
    if len(O) == 0:
        break
    print(O[0], end = "")
    del O[0]
    if len(E) == 0:
        break
    print(E[0], end = "")
    del E[0]
print()

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

def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(ns())
def nf(): return float(ns())

o = lc()
e = lc()

ans = []

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


print("".join(ans))

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

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

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

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

s = ''
i = 0
while True:
  if len(o) > i:
    s += o[i]
  else:
    break
  if len(e) > i:
    s += e[i]
  i += 1
  
print(s)

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

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

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

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

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

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

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

flg = 0
res = str()

l = [""] * 100

if len(O) != len(E):
    E += " "
    flg = 1

for i in range(len(O)):
    
    l[i*2] = O[i]
    l[i*2+1] = E[i]
else:
    for j in range(len(l)):
        res += l[j]
    if flg == 1:
        res = res[0:len(res)-1]

print(res)

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

flg = 0
res = str()

l = [""] * 100

if len(O) != len(E):
    E += " "
    flg = 1

for i in range(len(O)):
    
    l[i*2] = O[i]
    l[i*2+1] = E[i]
else:
    for j in range(len(l)):
        res += l[j]
    if flg == 1:
        res = res[0:len(res)-1]

print(res)

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

print("".join(map("".join, zip(list(a), list(b)))) + (a[-1] if len(a) != len(b) else ""))

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

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

print("".join(ans))

Solution (Python):
oList = list(input())
eList = list(input())
passList = [oList[0]]

for i in range(len(oList)-1):
    passList.append(eList[i])
    passList.append(oList[i+1])

if len(oList) == len(eList):
    passList.append(eList[-1])

print(''.join(passList))

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

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

Solution (Python):
O = list(input())
E = list(input())
llist = list(range(1, len(E)*2, 2))
for num in range(len(E)):
    O.insert(llist[num], E[num])

print(''.join(O))

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

for i in range (min(len(O),len(E))):
    data.append(O[i])
    data.append(E[i])
if len(O)>len(E):
    data.append(O[len(O)-1])
print(('').join(data))

Solution (Python):

o = input()
e = input()
ans=[]
for i,j in zip(o,e):
    ans.append(i+j)
    
if len(o)>len(e):
    ans.append(o[-1])

print(''.join(ans))

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

Solution (Python):


def main():
    o = input()
    e = input()
    password = ''
    if len(o) == len(e):
        for i in range(len(o)):
            password += o[i] + e[i]
    else:
        for i in range(min(len(o), len(e))):
            password += o[i] + e[i]
        password += o[-1]
    print(password)

if __name__ == '__main__':
    main()

Solution (Python):
o = input()
e = input()
output = ""
for a, b in zip(o, e):
    output += a+b
if len(o) - len(e) == 1:
    output += o[-1]
print(output)

Solution (Python):
from itertools import zip_longest
a=input()
b=input()
for (i,j) in zip_longest(a,b):
  if i is None:
    print(j,end="")
  elif j is None:
    print(i,end="")
  else:
    print(i+j,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()
ans =[]
for i,j in zip(O,E):
    ans.append(i)
    ans.append(j)

if len(O)>len(E):
    ans.append(O[-1])

print(''.join(map(str, 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])
else:
  print('')

Solution (Python):
O = input()
E = input()
S = ''
for i, o in enumerate(O):
  S += o
  if E:
    S += E[0]
    E = E[1:]
print(S)

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

ans = [None] * (len(O) + len(E))
for i in range(len(O)):
    ans[2 * i] = O[i]
for j in range(len(E)):
    ans[2 * j + 1] = E[j]
print(''.join(ans))

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

Solution (Python):
from itertools import zip_longest, chain

o = input()
e = input()

print("".join(chain(*zip_longest(o, e, fillvalue=""))))

Solution (Python):
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7

O = list(input())
E = list(input())
ans = ''

for i,s1 in enumerate(O):
	ans = ans + s1
	if i < len(E):
		ans = ans + E[i]

print(ans)

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

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

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

print(res)

Solution (Python):
from itertools import zip_longest

o = list(input())
e = list(input())
ans = ''
for odd, even in zip_longest(o, e, fillvalue = ''):
    ans += odd + even
print(ans)

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

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

Solution (Python):
from itertools import zip_longest
print(''.join([a+b for a,b in zip_longest(input(), input(),fillvalue='')]))

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):
x=list(input())
y=list(input())

ans=[]

for i in range(len(y)):
  ans.append(x[i])
  ans.append(y[i])
  
if len(y)<len(x):
  ans.append(x[len(x)-1])
  
print(''.join(ans))

Solution (Python):
from sys import stdin


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


if __name__ == '__main__':
    main()

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


if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin


def main():
    O = stdin.readline().rstrip()
    E = stdin.readline().rstrip()
    for o, e in zip(O, E):
        print(o, end='')
        print(e, end='')
    if len(O) > len(E):
        print(O[-1])


if __name__ == '__main__':
    main()

Solution (Python):
s1 = raw_input()
s2 = raw_input()
ans = ''
for i in range(min(len(s1), len(s2))):
    ans += s1[i] + s2[i]
if len(s2) < len(s1):
    ans += s1[-1]
if len(s1) < len(s2):
    ans += s2[-1]
print ans

Solution (Python):
s1 = raw_input()
s2 = raw_input()
ans = ''
for i in range(min(len(s1), len(s2))):
    ans += s1[i] + s2[i]
if len(s2) < len(s1):
    ans += s1[-1]
if len(s1) < len(s2):
    ans += s2[-1]
print ans

Solution (Python):
a = input()
b = input()
r = ""
for i,j in zip(a,b):
  r += i+j
print(r if len(a) == len(b) else r+a[-1])

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())
ans = []
while len(o) or len(e):
    if len(o):
        ans.append(o[0])
        del o[0]
    if len(e):
        ans.append(e[0])
        del e[0]
print(''.join(ans))

Solution (Python):

O = input()
E = input()

password = [0 for _ in range(len(O) + len(E))]

for i in range(len(O)):
    password[2 * i] = O[i]

for i in range(len(E)):
    password[2 * i + 1] = E[i]

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

Solution (Python):
odd, even = input(), input()

for i in range(len(even)):
  print(odd[i] + even[i], end="")

if len(odd) == len(even) + 1:
  print(odd[len(odd) - 1])

print("")

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

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

Solution (Python):
"""
https://abc058.contest.atcoder.jp/tasks/abc058_b
"""
o=input()
e=input()
p=""
if len(o)-len(e)==0:
    for i in range(len(o)):
        p=p+o[i]+e[i]
    print(p)
else:
    for i in range(len(e)):
        p=p=p+o[i]+e[i]
    p=p+o[len(o)-1]
    print(p)

Solution (Python):
o=input()
e=input()
x=['' for _ in range(len(o)+len(e))]
for i in range(0,len(o)+len(e),2):
    x[i]=o[i//2]
for i in range(1,len(o)+len(e),2):
    x[i]=e[(i-1)//2]
print(''.join(x))

Solution (Python):
o = input()
e = input()
counter = 0
ans = ""
while len(o) > counter:
    ans = str(ans) + o[counter]
    if len(o) > len(e):
        if counter == len(o)-1:
            break
    ans = ans + e[counter]
    counter+=1
print(ans)

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()
ans = []
n = len(o)
i = 0
while i < n:
	ans.append(o[i])
	if i < len(e):
		ans.append(e[i])
	i+=1
for i in range(len(ans)):
	if i != len(ans)-1:
		print(ans[i],end="")
	else:
		print(ans[i])

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

ans = ''
for i, O_i in enumerate(O):
    ans += O_i
    if len(E) > i:
        ans += E[i]

print(ans)

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

ans = ""

for i in range(max(len(O), len(E))):
    try:
        ans += O[i]
        ans += E[i]
    except IndexError:
        pass

print(ans)

Solution (Python):
O=raw_input()
E=raw_input()
x=[None]*(len(O)+len(E))
for i,c in enumerate(O):
  x[2*i] = c
for i,c in enumerate(E):
  x[2*i+1] = c
print ''.join(x)

Solution (Python):
a=input()
b=input()
if len(a)>len(b):b+=' '
r=''
for i in range(len(a)):
     r+=a[i]+b[i]
print(r)

Solution (Python):
print(''.join(s+t for s,t in zip(input(),input()+' ')))

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

Solution (Python):
from itertools import zip_longest

def main():
    o = input()
    e = input()
    print("".join([oi + ei for (oi, ei) in zip_longest(o, e, fillvalue="")]))

if __name__ == '__main__':
    main()

Solution (Python):
from itertools import zip_longest

def main():
    o = input()
    e = input()
    s = ''
    print("".join([s + oi + ei for (oi, ei) in zip_longest(o, e, fillvalue="")]))

if __name__ == '__main__':
    main()

Solution (Python):
o = list(input())
e = list(input())
s =[]
a=0
b=0
for i in range(len(o) + len(e)):
    if i % 2 == 0:
        s.append(o[a])
        a += 1
    else :
        s.append(e[b])
        b += 1

    
print('{}'.format("".join(s)))

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

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

olen = len(O)
elen = len(E)

word = ""

if olen==elen:
    for i in range(olen):
        word = word + O[i] + E[i]
else:
    for i in range(elen):
        word = word + O[i] + E[i]
    word = word + O[olen-1]

print(word)

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

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

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

print(Ans+post)

Solution (Python):
o, e = input(), input()+" "
print(''.join(map(''.join, zip(o,e))))

Solution (Python):
a=list(input().strip())
b=list(input().strip())
if len(b)<len(a):
  b.append("")
ans=""
for i,j in zip(a,b):
  ans=ans+i+j
print(ans)

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

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

Solution (Python):
PASS = [input() for _ in range(2)]
N = len(PASS[0]) + len(PASS[1])
ans = ""
for i in range(N):
    ans += PASS[i%2][i//2]
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])

Solution (Python):
s = input()
t = input()
l = len(t)
for i in range(l):
    print(s[i], end='')
    print(t[i], end='')
if l < len(s):
    print(s[-1], end='')
print()

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

idx, pw = 0, ''
while idx < len(e):
    pw += o[idx]
    pw += e[idx]
    idx += 1

if idx < len(o):
    pw += o[idx]

print(pw)

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 k in range(len(O)+len(E)):
    if k%2==0:
        ans += O[k//2]
    else:
        ans += E[k//2]
print(ans)

Solution (Python):
odd, even = input(), input()
p = "".join([o+e for o, e in zip(odd, even)])
if len(odd) != len(even):
  p += odd[-1]
print(p)

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

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

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

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

Solution (Python):
a,b=list(input()),list(input())
l=len(a+b)
ans=""
for i in range(l):
  if i % 2 == 0:
    ans += a.pop(0)
  else:
    ans += b.pop(0)
print(ans)

Solution (Python):
from itertools import zip_longest
print("".join(["".join(a) for a in zip_longest(input(),input(),fillvalue="")]))

Solution (Python):
from itertools import zip_longest
print("".join(["".join(a) for a in zip_longest(input(),input(),fillvalue="")]))

Solution (Python):
from itertools import zip_longest
print("".join(["".join(a) for a in zip_longest(input(),input(),fillvalue="")]))

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

Solution (Python):
O = input()
E = input()
 
if len(O)-len(E)>0:E+=" "
 
for a,b in zip(O,E):
    print(a+b.strip(),end="")

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

if len(O)-len(E)>0:E+=" "

for a,b in zip(O,E):
    print(a+b.strip(),end="")

Solution (Python):
O_list = list(input())
E_list = list(input())
output_str = ""
for i, j in zip(O_list, E_list):
    output_str += i + j
    
if  len(O_list) - len(E_list) == 1:
    output_str += O_list[-1]
    
print(output_str)

Solution (Python):
O, E = input(), input()
if len(O)!=len(E):
    E += '0'

ans = ''
for (i, j) in zip(O, E):
    if j=='0':
        ans += i
    else:
        ans += i+j
print(ans)

Solution (Python):
o = list(input())
e = list(input())
ls = []
for x in range(min(len(o), len(e))):
    ls.append(o[x])
    ls.append(e[x])
else:
    if len(o) < len(e):
        for i in range(x+1, len(e)):
            ls.append(e[i])
    elif len(o) > len(e):
        for i in range(x+1, len(o)):
            ls.append(o[i])
print(''.join(ls))

Solution (Python):
odd = input()
even = input()
password = ''
i = 0
while i < len(even):
    password += odd[i] + even[i]
    i += 1
if i < len(odd):
    password += odd[i]
print(password)

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])
print(''.join(x))

Solution (Python):





if __name__ == '__main__':
    odd_th_password = input()
    even_th_password = input()
    original_password = ''

    for i in range(max(len(odd_th_password), len(even_th_password))):
        if i < len(odd_th_password):
            original_password += ''.join(odd_th_password[i])
        if i < len(even_th_password):
            original_password += ''.join(even_th_password[i])

    print(original_password)

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:

        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result

arr_data = getinputdata()

o = arr_data[0][0]
e = arr_data[1][0]



strdata=""
for v in range(0, len(e)):

    strdata += o[v]

    strdata += e[v]

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




print(strdata)

Solution (Python):
o,e = input(),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()
answer = ""
while o != "":
	answer += o[0]
	o = o[1:]
	if e != "":
		answer += e[0]
		e = e[1:]
print(answer)

Solution (Python):
from collections import deque

O = input()
E = input()

OQ = deque(O)
EQ = deque(E)
P = ''
for i in range(1, len(O) + len(E) + 1):
    if i % 2 == 1:
        P += OQ.popleft()
    else:
        P += EQ.popleft()
print(P)

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

o = ns()
e = ns()

a = []
o_len = 0
e_len = 0
for i in range(50):
    if o_len != len(o):
        a.append(o[i])
        o_len += 1
    else:
        continue
    if e_len != len(e):
        a.append(e[i])
        e_len += 1
    else:
        continue
while "\n" in a:
    a.remove("\n")
a = "".join(a)
print(a)

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

ans_str = ''
for i, j in zip(o, e):
    ans_str += i + j

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

print(ans_str)

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

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

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

Solution (Python):
o=input()
e=input()
n=len(e)
a=""
if len(o)-len(e)==0:
    for i in range(n):
        a=a+o[i]+e[i]
    print(a)
else:
    for i in range(n):
        a=a+o[i]+e[i]
    a=a+o[n]
    print(a)

Solution (Python):
import sys
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().strip()
E = input().strip()

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

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

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

print(T)

Solution (Python):

"""
https://abc058.contest.atcoder.jp/tasks/abc058_b

"""
import sys
from sys import stdin
input = stdin.readline


def solve(O, E):
    ans = ''
    for o, e in zip(O, E):
        ans += o + e
    if len(O) > len(E):
        ans += O[-1]
    return ans


def main(args):
    O = input().strip()
    E = input().strip()
    ans = solve(O, E)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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

import itertools


print("".join(itertools.chain(*itertools.zip_longest(odd, even, fillvalue=""))))

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

Solution (Python):
o = list(input())
e = list(input())
p = []
for i in range(len(e)):
   p.append(o[i])
   p.append(e[i])

if len(o)-len(e)==1:
   p.append(o[-1])

print(''.join(p))

Solution (Python):
from itertools import zip_longest
o = input()
e = input()
for oc, ec in zip_longest(o, e):
    print(oc + ec, end="") if ec is not None else print(oc, end="")
print("")

Solution (Python):
s = [input() for _ in range(2)]
print(''.join([i + j for i, j in zip(s[0], s[1])]) if len(s[0]) == len(s[1]) else ''.join([i + j for i, j in zip(s[0], s[1])]) + s[0][len(s[0])-1])

Solution (Python):
def decode(a,b):
	s=''
	for i in range(max(len(a),len(b))):
		m=a[i] if i<len(a) else ''
		n=b[i] if i<len(b) else ''
		s+=m+n
	return s

o=input()
e=input()
print(decode(o,e))

Solution (Python):

a = input()
b = input()

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

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

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

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

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

    print(ans.strip())

if __name__ == '__main__':
    main()

Solution (Python):
print("".join("".join(x)for x in zip(input(),input()+" ")).strip())

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

    answer = []
    for odd, even in zip(O, E):
        answer.append(odd)
        answer.append(even)

    if len(O) > len(E):
        answer.append(O[-1])

    print("".join(answer))


solve()

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

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=raw_input()
E=raw_input()
S=""
for i in range(len(O)):
	if i<len(E):
		S+=O[i]+E[i]
	else:
		if len(O)==len(E):
			S+=O[i]+E[i]
		else:
			S+=O[i]
print S

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

print(password)

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

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

Solution (Python):
val = input()
val2 = input()

res = ""
for i in range(0, min(len(val), len(val2))):
    res += val[i]
    res += val2[i]

if len(val) == len(val2):
    pass
elif len(val) > len(val2):
    res += val[-1]
else:
    res += val2[-1]
print(res)

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

Solution (Python):


O=input()
E=input()

s=''

for i in range(0, len(E)):
    s+=O[i]+E[i]

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

print(s)

Solution (Python):
o = input()
e = input()
for oo,ee in zip(o, e):
    print(oo+ee, end="")
if len(o) > len(e):
    print(o[-1], end="")

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

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

Solution (Python):
a = raw_input()
b = raw_input()
c = ""
count  = 0
while count < len(b) :
    c += a[count]+b[count]
    count += 1
try:
    c += a[count]
except:
    pass
print c

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

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

print(''.join(o))

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):
    ans += e[-1]

print(ans)

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

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

print(O[-1] if len(O) > len(E) else '')

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

Solution (Python):
from itertools import zip_longest
O = input()
E = input()
for w, z in zip_longest(O, E):
    if w == None:
        print(z, end="")
    elif z == None:
        print(w, end="")
    else:
        print(w + z, end="")
print()

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

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):
eve = raw_input()
odd = raw_input()

ans = ""

for i in range(len(eve)):
    ans += eve[i]
    if i < len(odd):
        ans += odd[i]

print ans

Solution (Python):
o=input()
e=input()
ans=[""]*(len(o)+len(e))
for i,s in enumerate(o):
    ans[2*i]=s
for i,s in enumerate(e):
    ans[2*i+1]=s
print("".join(ans))

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


if __name__ == "__main__":
    main()

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