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-----
xyz
abc

-----Sample Output-----
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.
[{"code": "q=str(input())\ne=str(input())\na=len(q)\nb=len(e)\nc=\"\"\nif a==b:\n  for i in range(a):\n    c+=q[i]\n    c+=e[i]\nelse:\n  for i in range(b):\n    c+=q[i]\n    c+=e[i]\n  c+=q[a-1]\n\nprint(c)", "passed": true, "time": 0.21, "memory": 14308.0, "status": "done"}, {"code": "o = input()\ne = input()\npassword = \"\"\n\nfor i in range(len(o)):\n    password += o[i]\n    if len(e) > i:\n        password += e[i]\n\nprint(password)", "passed": true, "time": 0.19, "memory": 14080.0, "status": "done"}, {"code": "O = input()\nE = input()\nAns = []\n\nif len(O) - len(E) == 0:\n  for i in range(len(O)):\n  \tAns.append(O[i])\n  \tAns.append(E[i])\nelse:\n  for i in range(len(E)):\n    Ans.append(O[i])\n    Ans.append(E[i])\n  Ans.append(O[len(O)-1])\n  \nprint(''.join(Ans))", "passed": true, "time": 0.19, "memory": 14232.0, "status": "done"}, {"code": "o = input()\ne = input()\nres = \"\"\nn = min(len(o), len(e))\nfor i in range(n):\n    res += o[i] + e[i]\n\nif len(e) > len(o):\n    res += e[-1]\nelif len(e) < len(o):\n    res += o[-1]\n\nprint(res)\n", "passed": true, "time": 0.14, "memory": 14176.0, "status": "done"}, {"code": "a = input()\nb = input()\nli = []\nif len(a) == len(b):\n    for i in range(len(a)):\n        li.append(a[i]+b[i])\nelse:\n    for i in range(len(b)):\n        li.append(a[i]+b[i])\n    li.append(a[-1])\nprint(''.join(li))", "passed": true, "time": 0.18, "memory": 14092.0, "status": "done"}, {"code": "A = input()\nB = input()\n\npw = \"\"\nif len(A) == len(B):\n    for i in range(len(A)):\n        pw += A[i]\n        pw += B[i]\n    print(pw)\n    return\n\nelse:\n    for i in range(len(B)):\n        pw += A[i]\n        pw += B[i]\n    print(pw + A[-1])\n    return", "passed": true, "time": 0.14, "memory": 14084.0, "status": "done"}, {"code": "a,b=input(),input();n=[i+j for i,j in zip(a,b)]\nprint(*[n,n+[a[-1]]][len(a)-len(b)==1],sep='')", "passed": true, "time": 0.27, "memory": 14064.0, "status": "done"}, {"code": "a = list(input())\nb = list(input())\nf = False\nx = []\nif len(a)> len(b):\n    b.append(0)\n    f = True\nfor i in range(len(a)):\n    x.append(a[i])\n    x.append(b[i])\nif f:\n    x.pop()\nprint(\"\".join(x))", "passed": true, "time": 0.28, "memory": 14204.0, "status": "done"}, {"code": "o = [a for a in str(input())]\ne = [b for b in str(input())]\nans = []\nfor i in range(len(e)):\n  ans.append(o[i])\n  ans.append(e[i])\nif len(o) > len(e):\n  ans.append(o[-1])\nprint(\"\".join(ans))", "passed": true, "time": 0.14, "memory": 14240.0, "status": "done"}, {"code": "import math\nimport collections\nii = lambda : int(input())\nmi = lambda : map(int,input().split())\nli = lambda : list(map(int,input().split()))\n\no = input()\ne = input()\nfor i in range(len(e)):\n    print(o[i] + e[i] ,end = \"\")\nif len(o) != len(e):\n    print(o[-1])\nelse:\n    print()", "passed": true, "time": 0.23, "memory": 14244.0, "status": "done"}, {"code": "from collections import deque\nfrom itertools import count\nOdd = deque(input())\nEven = deque(input())\nrtnList = lambda x: Odd if x & 1 else Even\nans = ''\nfor i in count(1,1):\n    try:\n        s = rtnList(i).popleft()\n    except IndexError:\n        print(ans)\n        return\n    ans += s\n", "passed": true, "time": 0.14, "memory": 14272.0, "status": "done"}, {"code": "O = input()\nE = input()\no = len(O)\ne = len(E)\n[print(O[i], E[i], sep = \"\", end = \"\") for i in range(min(o, e))]\nprint(\"\" if o == e else O[-1])", "passed": true, "time": 0.14, "memory": 14208.0, "status": "done"}, {"code": "O = list(input())\nE = list(input())\n\nans = [0]*(len(O)+len(E))\nfor i in range(len(ans)):\n    if i % 2 == 0:\n        ans[i] = O[0]\n        del O[0]\n    else:\n        ans[i] = E[0]\n        del E[0]\n        \nprint(\"\".join(ans))", "passed": true, "time": 0.23, "memory": 14176.0, "status": "done"}, {"code": "O=input()\nE=input()\nans=\"\"\nfor i in range(len(O)) :\n  ans+=O[i]\n  if i<len(E) :\n    ans+=E[i]\nprint(ans)", "passed": true, "time": 0.15, "memory": 14044.0, "status": "done"}, {"code": "o = input()\ne = input()\nans = []\nfor i in range(len(e)):\n    ans.append(o[i])\n    ans.append(e[i])\nif len(o) != len(e):\n    ans.append(o[-1])\nprint(\"\".join(ans))", "passed": true, "time": 0.14, "memory": 14224.0, "status": "done"}, {"code": "li_o = input()\nli_e = input()\nan = ''\nfor i in range(len(li_o)):\n    an += li_o[i]\n    if i != len(li_e):\n        an += li_e[i]\n    else:\n        break\nprint(an)", "passed": true, "time": 0.49, "memory": 14312.0, "status": "done"}, {"code": "#from statistics import median\n#import collections\n#aa = collections.Counter(a) # list to list || .most_common(2)\u3067\u6700\u5927\u306e2\u500b\u3068\u308a\u3060\u305b\u308b\u304a a[0][0]\nfrom math import gcd\nfrom itertools import combinations,permutations,accumulate, product # (string,3) 3\u56de\n#from collections import deque\nfrom collections import deque,defaultdict,Counter\nimport decimal\nimport re\nimport math\nimport bisect\nimport heapq\n#\n#\n#\n# python\u3067\u7121\u7406\u306a\u3068\u304d\u306f\u3001pypy\u3067\u3084\u308b\u3068\u6b63\u89e3\u3059\u308b\u304b\u3082\uff01\uff01\n#\n#\n# my_round_int = lambda x:np.round((x*2 + 1)//2)\n# \u56db\u6368\u4e94\u5165g\n#\n# \u30a4\u30f3\u30c7\u30c3\u30af\u30b9\u7cfb\n# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);\n# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);\n#\n#\nimport sys\nsys.setrecursionlimit(10000000)\nmod = 10**9 + 7\n#mod = 9982443453\n#mod = 998244353\nINF = float('inf')\nfrom sys import stdin\nreadline = stdin.readline\ndef readInts():\n  return list(map(int,readline().split()))\ndef readTuples():\n    return tuple(map(int,readline().split()))\ndef I():\n    return int(readline())\no = input()\ne = input()\nans = \"\"\nfor i in range(len(o)):\n    ans += o[i]\n    if i >= len(e):\n        pass\n    else:\n        ans += e[i]\nprint(ans)\n", "passed": true, "time": 0.15, "memory": 14184.0, "status": "done"}, {"code": "O = str(input())\nE = str(input())\nS = ''\nfor i in range(len(O) + len(E)):\n    if i % 2 == 0:\n        S += O[(i // 2)]\n    else:\n        S += E[(i // 2)]\n    \nprint(S)", "passed": true, "time": 0.14, "memory": 14116.0, "status": "done"}, {"code": "o = list(input())\ne = list(input())\n\nlst = []\nfor oo,ee in zip(o,e):\n    lst.append(oo+ee)\n\nif len(o)-len(e) == 1:\n    lst.append(o[-1])\n\nprint(\"\".join(lst))", "passed": true, "time": 0.14, "memory": 14196.0, "status": "done"}, {"code": "o=input()\ne=input()\nO=len(o)\nE=len(e)\na=[]\nif O==E:\n    for i in range(O):\n        a.append(o[i]+e[i])\n    b=''.join(a)\n    print(b)\nelse:\n    for i in range(E):\n        a.append(o[i]+e[i])\n    a.append(o[O-1])\n    b=''.join(a)\n    print(b)", "passed": true, "time": 0.15, "memory": 14196.0, "status": "done"}, {"code": "def answer(o: str, e: str) -> str:\n    result = ''\n    e += ' '\n    for i in range(len(o)):\n        result += o[i] + e[i]\n\n    return result.strip()\n\n\ndef main():\n    o = input()\n    e = input()\n    print(answer(o, e))\n\n\ndef __starting_point():\n    main()\n__starting_point()", "passed": true, "time": 0.14, "memory": 14324.0, "status": "done"}, {"code": "def main():\n    O = input()\n    E = input()\n    pas = ''\n    for i in range(len(E)):\n        pas += O[i] + E[i]\n    if len(O) > len(E):\n        pas += O[-1]\n    print(pas)\n\ndef __starting_point():\n    main()\n__starting_point()", "passed": true, "time": 0.14, "memory": 14056.0, "status": "done"}, {"code": "def main():\n    O = list(input())\n    E = list(input())\n    O.reverse()\n    E.reverse()\n    ans = ''\n    for _ in range(200):\n        ans += O.pop()\n        if len(E) == 0:\n            break\n        ans += E.pop()\n        if len(O) == 0:\n            break\n    print(ans)\n\ndef __starting_point():\n    main()\n\n__starting_point()", "passed": true, "time": 0.14, "memory": 14244.0, "status": "done"}, {"code": "o=input()\ne=input()\np=\"\"\nfor i in range(len(e)):\n    p+=o[i]\n    p+=e[i]\nif len(o)!=len(e):\n    p+=o[-1]\nprint(p)\n\n\n", "passed": true, "time": 0.14, "memory": 14104.0, "status": "done"}, {"code": "o = input()\ne = input()\nfor i in range(len(o)):\n    print(o[i], end=\"\")\n    if i < len(e):\n        print(e[i], end=\"\")\nprint()\n", "passed": true, "time": 0.14, "memory": 14052.0, "status": "done"}, {"code": "o=list(input())\ne=input()\nfor i in range(len(e)):\n    o.insert(2*i+1,e[i])\nprint(*o,sep=\"\")\n", "passed": true, "time": 0.14, "memory": 14260.0, "status": "done"}, {"code": "O=input()\nE=input()\nans=\"\"\nfor i in range(len(E)):\n  ans+=O[i]\n  ans+=E[i]\n\nif len(O)!=len(E):\n  ans+=O[-1]\nprint(ans)", "passed": true, "time": 0.19, "memory": 14316.0, "status": "done"}, {"code": "o=input()\ne=input()\nn=len(o)\nm=len(e)\nans=[]\nfor i in range(m):\n  ans.append(o[i])\n  ans.append(e[i])\nif n-m==0:\n  print(*ans,sep='')\nelse:\n  ans.append(o[n-1])\n  print(*ans,sep='')", "passed": true, "time": 0.14, "memory": 14236.0, "status": "done"}, {"code": "import sys\ninput = sys.stdin.readline\nfrom collections import deque\n\n\ndef read():\n    O = input().strip()\n    E = input().strip()\n    return O, E\n\n\ndef solve(O, E):\n    ans = []\n    oq = deque(O)\n    eq = deque(E)\n    while eq:\n        ans.append(oq.popleft())\n        ans.append(eq.popleft())\n    if oq:\n        ans.append(oq.popleft())\n    return \"\".join(ans)\n\n\ndef __starting_point():\n    inputs = read()\n    outputs = solve(*inputs)\n    if outputs is not None:\n        print((\"%s\" % str(outputs)))\n\n__starting_point()", "passed": true, "time": 0.14, "memory": 14136.0, "status": "done"}, {"code": "o=input()\ne=input()\nans=''\nfor i in range(len(e)):\n        ans+=o[i]\n        ans+=e[i]\nif len(o)==len(e):\n    print(ans)\nelse:\n    print((ans+o[-1]))\n", "passed": true, "time": 0.14, "memory": 14136.0, "status": "done"}, {"code": "o = input()\ne = input()\nans = ''\nfor i in range(len(e)):\n    ans +=o[i]+e[i]\nif len(o) != len(e):\n    ans +=o[-1]\nprint(ans)", "passed": true, "time": 0.14, "memory": 14084.0, "status": "done"}, {"code": "o = input()\ne = input()\n\nans = ''\nfor i,j in zip(o,e):\n    ans+= i+j\nif len(o) != len(e):\n    ans+=o[-1]\nprint(ans)", "passed": true, "time": 0.24, "memory": 14288.0, "status": "done"}, {"code": "O = list(input())\nE = list(input())\n\nres = []\n\nif len(O) - len(E) == 0:\n    for i, j in zip(O, E):\n        res.append(i)\n        res.append(j)\nelse:\n    E.append('')\n    for i, j in zip(O, E):\n        res.append(i)\n        res.append(j)\n    res.pop(-1)\n \npw = ''.join(res)\nprint(pw)", "passed": true, "time": 0.24, "memory": 14136.0, "status": "done"}, {"code": "O = input()\nE = input()\nt = \"\"\nn = min(len(O), len(E))\nfor i in range(n):\n  t += O[i] + E[i]\nif len(O) > len(E):\n  t += O[len(O)-1]\nelif len(O) < len(E):\n  t += E[len(E)-1]\nprint(t)\n", "passed": true, "time": 0.14, "memory": 14312.0, "status": "done"}, {"code": "#n = int(input())\n#a, b = map(int,input().split())\n#l = list(map(int,input().split()))\n#l = [list(map(int,input().split())) for i in range(n)]\no = list(input())\ne = list(input())\noc = 0\nec = 0\n\nans = ''\n\nn = len(o)+len(e)\nfor i in range(1,n+1):\n    if i % 2 == 0:\n        add = e[ec]\n        ec += 1\n    else:\n        add = o[oc]\n        oc += 1\n    ans += add\n\nprint(ans)\n", "passed": true, "time": 0.15, "memory": 14116.0, "status": "done"}, {"code": "a = input()\nb = input()\ns = \"\"\nfor i in range(len(b)):\n    s += a[i] + b[i]\nif len(a) > len(b):\n    s += a[-1]\nprint(s)", "passed": true, "time": 0.14, "memory": 14080.0, "status": "done"}, {"code": "o = input()\ne = input()\nans = ''\nif len(o) == len(e):\n    time = len(o) * 2\nelse:\n    time = len(o) * 2 - 1\nfor i in range(time):\n    if i % 2 == 0:\n        ans += o[i // 2]\n    else:\n        ans += e[i // 2]\nprint(ans)", "passed": true, "time": 0.14, "memory": 14244.0, "status": "done"}, {"code": "o = input()\ne = input()\nans = ''\nfor i in range(len(e)):\n    ans += o[i]+e[i]\n\nif len(o) == len(e):\n    print(ans)\nelse:\n    print(ans+o[-1])", "passed": true, "time": 0.15, "memory": 14288.0, "status": "done"}, {"code": "O = input()\nE = input()\n\ncombi=''\n\nfor i in range(len(O)+len(E)):\n    if i%2==0:\n        combi+=O[i//2]\n    elif i%2!=2:\n        combi+=E[i//2]\nprint(combi)", "passed": true, "time": 0.14, "memory": 14060.0, "status": "done"}, {"code": "odd = list(map(str, input()))\neven = list(map(str, input()))\nif len(odd)==len(even):\n  L=len(odd)*2\nelse:\n  L=len(odd)+len(even)\nli=[]\n\nfor i in range(1,L+1):\n  if i%2==1:\n    if i==1:\n      li.append(odd[0])\n    else:\n      li.append(odd[i//2])\n  else:\n    li.append(even[i//2-1])\n    \nprint(''.join(li))", "passed": true, "time": 0.14, "memory": 14324.0, "status": "done"}, {"code": "O = input()\nE = input()\ns = \"\"\n\nfor so,se in zip(O,E):\n    s += so+se\n\nif len(list(O)) > len(list(E)):\n    s += O[-1]\nelif len(list(O)) < len(list(E)):\n    s += E[-1]\n    \nprint(*s,sep=\"\")", "passed": true, "time": 0.17, "memory": 14072.0, "status": "done"}, {"code": "o = list(input())\ne = list(input())\n\nans = list()\n\nfor i in range(len(e)):\n    ans.append(o[i])\n    ans.append(e[i])\n\nif len(o) != len(e):\n    ans.append(o[-1])\n\nprint((''.join(ans)))\n", "passed": true, "time": 0.14, "memory": 14120.0, "status": "done"}, {"code": "o = input()\ne = input()\nd = \"\"\nif len(o) == len(e):\n  for i in range(len(o)):\n    d += o[i]\n    d += e[i]\n  print(d)\nelse:\n  for i in range(len(e)):\n    d += o[i]\n    d += e[i]\n  d += o[-1]\n  print(d)", "passed": true, "time": 0.17, "memory": 14276.0, "status": "done"}, {"code": "O = input()\nE = input()\n\nans = ''\n\nif len(O) == len(E):\n   for i in range(len(O)):\n      ans += O[i]\n      ans += E[i]\nelse:\n   for i in range(len(E)):\n      ans += O[i]\n      ans += E[i]\n   ans += O[-1]\n\nprint(ans)", "passed": true, "time": 0.14, "memory": 14176.0, "status": "done"}, {"code": "a,b=input(),input();n=[i+j for i,j in zip(a,b)]\nprint(*[n,n+[a[-1]]][len(a)-len(b)],sep='')", "passed": true, "time": 0.14, "memory": 14048.0, "status": "done"}, {"code": "o = list(input())\ne = list(input())\n\nans = ''\nfor i in range(len(e)):\n    ans += o[i] + e[i]\nif len(o) > len(e):\n    ans += o[len(o) - 1]\nprint(ans)", "passed": true, "time": 0.14, "memory": 14108.0, "status": "done"}, {"code": "def actual(O, E):\n    s = ''.join([f'{o}{e}' for o, e in zip(O, E)])\n\n    if len(O) - len(E) == 1:\n        s += O[-1]\n\n    return s\n\nO = input()\nE = input()\n\nprint(actual(O, E))", "passed": true, "time": 0.14, "memory": 14092.0, "status": "done"}, {"code": "o = input()\ne = input()\n\nans = ''\nfor i in range(len(e)):\n    ans += o[i]\n    ans += e[i]\nif len(e) < len(o):\n    ans += o[-1]\nprint(ans)\n", "passed": true, "time": 0.22, "memory": 14316.0, "status": "done"}, {"code": "o=input()\ne=input()\n\np=\"\"\n\nfor i in range(len(o)):\n    p+=o[i]\n    if i<len(e):\n        p+=e[i]\n        \nprint (p)\n\n\n", "passed": true, "time": 0.14, "memory": 14240.0, "status": "done"}, {"code": "o = str(input())\ne = str(input())\n\nans = ''\nfor i in range(len(e)):\n    ans += o[i]\n    ans += e[i]\nif len(o) != len(e):\n    ans += o[-1]\nprint(ans)", "passed": true, "time": 0.14, "memory": 14296.0, "status": "done"}, {"code": "o = input()\ne = input()\nans = []\nfor i in range(len(o)+len(e)):\n  if i%2 == 0:\n    ans.append(o[i//2])\n  else:\n    ans.append(e[i//2])\nprint(\"\".join(ans))", "passed": true, "time": 0.14, "memory": 14164.0, "status": "done"}, {"code": "#-*-coding:utf-8-*-\nimport sys\ninput=sys.stdin.readline\n\ndef main():\n    O = input().rstrip()\n    E = input().rstrip()\n    password=\"\"\n    last = \"\"\n\n    if len(O) > len(E):\n        last = O[-1]\n    elif len(O) < len(E):\n        last = E[-1]\n    else:\n        last=\"\"\n\n    for p1,p2 in zip(O,E):\n        password+=p1+p2\n    print(password+last)\n\ndef __starting_point():\n    main()\n__starting_point()", "passed": true, "time": 0.24, "memory": 14192.0, "status": "done"}, {"code": "O = input()\nE = input()\n\nresult = ''\nif len(O) == len(E):\n    for i in range(len(O)):\n        result += O[i] + E[i]\nelse:\n    for i in range(len(E)):\n        result += O[i] + E[i]\n    result += O[-1]\n\nprint(result)", "passed": true, "time": 0.23, "memory": 14244.0, "status": "done"}, {"code": "o = input()\ne = input()\nans = ''\nfor i in range(len(e)):\n    ans += o[i] + e[i]\nif len(o) - len(e) == 1:\n    ans += o[len(o)-1]\nprint(ans)", "passed": true, "time": 0.14, "memory": 14176.0, "status": "done"}, {"code": "o = input()\ne = input()\n\nn = len(o) + len(e)\ns = ['' for _ in range(n)]\nfor i in range(n):\n    j = i // 2\n    if i % 2 == 0:\n        s[i] = o[j]\n    else:\n        s[i] = e[j]\n\nprint((''.join(s)))\n", "passed": true, "time": 0.15, "memory": 14292.0, "status": "done"}, {"code": "O = input()\nE = input()\n\nans = ''\n\nfor i in range(len(E)):\n    ans += O[i] + E[i]\n\nif len(O) != len(E):\n    ans += O[-1]\n\nprint(ans)\n", "passed": true, "time": 0.18, "memory": 14288.0, "status": "done"}, {"code": "o = str(input())\ne = str(input())\na = ''\nfor i in range(len(e)):\n    a += o[i]\n    a += e[i]\n    if len(o) != len(e) and i == len(e) - 1:\n        a += o[i + 1]\nprint(a)", "passed": true, "time": 0.27, "memory": 14388.0, "status": "done"}, {"code": "#58B\nA=list(input())\nB=list(input())\nx=A[0]+B[0]\nfor i in range(1,len(B)):\n    x=x+A[i]+B[i]\nif len(A)>len(B):\n    x=x+A[-1]\nprint(x)", "passed": true, "time": 0.31, "memory": 14280.0, "status": "done"}, {"code": "o = input()\ne = input()\n\nans = ''\nfor i in range(len(o) + len(e)):\n    if i % 2 == 0:\n        ans += o[i - (i // 2)]\n    else:\n        ans += e[i - ((i + 1) // 2)]\n\nprint(ans)\n", "passed": true, "time": 0.14, "memory": 14104.0, "status": "done"}, {"code": "s1 = input()\ns2 = input()\nans = \"\"\nfor i,j in zip(s1, s2):\n  ans += (i + j)\n  \nif len(s1) != len(s2):\n  ans += s1[-1]\nprint(ans)", "passed": true, "time": 0.16, "memory": 14032.0, "status": "done"}, {"code": "o = input()\ne = input()\n\np = ''\nfor i in range(len(e)):\n    p += o[i] + e[i]\nif len(o) > len(e):\n    p += o[-1]\nprint(p)", "passed": true, "time": 0.23, "memory": 14244.0, "status": "done"}, {"code": "s = input()\nt = input()\nans = \"\"\nif (len(s) + len(t)) % 2 == 0:\n  for i in range(len(s)):\n    ans += s[i]\n    ans += t[i]\nelse:\n  for i in range(len(t)):\n    ans += s[i]\n    ans += t[i]\n  ans += s[-1]\n  \nprint(ans)", "passed": true, "time": 0.15, "memory": 14160.0, "status": "done"}, {"code": "O = input()\nE = input()\nS = \"\"\n\nif len(O) == len(E):\n  for i in range(len(O)):\n    S += O[i] + E[i]\n    \nelse:\n  for i in range(len(E)):\n    S += O[i] + E[i]\n  S += O[len(O)-1]\n  \nprint(S)", "passed": true, "time": 0.15, "memory": 14332.0, "status": "done"}, {"code": "O = input()\nE = input()\n\npassword = ''\nfor o, e in zip(O, E):\n    s = o + e\n    password += s\n\nif len(O) > len(E):\n    print(password + O[-1])\nelif len(O) < len(E):\n    print(password + E[-1])\nelse:\n    print(password)", "passed": true, "time": 0.23, "memory": 14280.0, "status": "done"}, {"code": "o = input()\ne = input()\na = \"\"\n\nfor i in range(len(o)):\n    a += o[i]\n    if i < len(e):\n        a += e[i]\n\nprint(a)", "passed": true, "time": 0.14, "memory": 14224.0, "status": "done"}, {"code": "ans = \"\"\nO = input()\nE = input()\nfor o, e in zip(O, E):\n    ans += o + e\nif len(O) > len(E):\n    ans += O[-1]\n\nprint(ans)\n", "passed": true, "time": 0.14, "memory": 14036.0, "status": "done"}, {"code": "o = str(input())\ne = str(input())\n\nans = \"\"\njudge = False\nif len(o)-len(e) == 1:\n    judge = True\n\nfor i in range(len(e)):\n    ans += o[i]\n    ans += e[i]\nif judge:\n    ans += o[-1]\n\nprint(ans)", "passed": true, "time": 0.14, "memory": 14284.0, "status": "done"}, {"code": "import math\na=input()\nb=input()\n\nn=''\nfor i in range(len(a)+len(b)):\n    if i%2==0:\n        n=n+a[i//2]\n    else:\n        n=n+b[math.ceil(i/2)-1]\nprint(n)", "passed": true, "time": 0.14, "memory": 14120.0, "status": "done"}, {"code": "o = input()\ne = input()\nans = \"\".join([o[i]+e[i] for i in range(min(len(o), len(e)))])\nif len(o)!=len(e):\n    if len(o) > len(e): ans += o[-1]\n    else: ans += e[-1]\nprint(ans)", "passed": true, "time": 0.14, "memory": 14332.0, "status": "done"}, {"code": "o = input()\ne = input()\n\nlen_o = len(o)\nlen_e = len(e)\nans = ''\n\nif len_o == len_e:\n  for i in range(len_o):\n    ans += o[i]\n    ans += e[i]\nelif len_o > len_e:\n  for i in range(len_e):\n    ans += o[i]\n    ans += e[i]\n  for i in range(len_e, len_o):\n    ans += o[i]\nelse:\n  for i in range(len_o):\n    ans += o[i]\n    ans += e[i]\n  for i in range(len_o, len_e):\n    ans += e[i]\nprint(ans)\n", "passed": true, "time": 0.14, "memory": 14252.0, "status": "done"}, {"code": "import sys, math\nfrom itertools import combinations as c, product as p\nfrom collections import deque\nsys.setrecursionlimit(10**9)\nINF = float('inf')\nMOD = 10**9 + 7\n#MOD = 998244353\n\n\ndef si(): return input()\ndef ii(): return int(input())\ndef fi(): return float(input())\ndef lstr(): return input().split()\ndef lint(): return list(map(int, input().split()))\ndef lintdec(): return list(map(lambda x:int(x) - 1, input().split()))\ndef lnstr(n): return [input() for _ in range(n)]\ndef lnint(n): return [int(input()) for _ in range(n)]\ndef lint_list(n): return [lint() for _ in range(n)]\n\n\n\n############################################################\nO = si()\nE = si()\n\nfor i in range(len(O + E)):\n    if i % 2:\n        print(E[i // 2], end='')\n    else:\n        print(O[i // 2], end='')\nprint()", "passed": true, "time": 0.14, "memory": 14168.0, "status": "done"}, {"code": "o = input()\ne = input()\n\nres = \"\"\nfor i, j in zip(o, e):\n    res += i + j\nif(len(o) != len(e)): res += o[-1]\nprint(res)", "passed": true, "time": 0.14, "memory": 14056.0, "status": "done"}, {"code": "o = input()\ne = input()\np = ''\nif len(o) == len(e):\n  for i in range(0, len(o)):\n    p += o[i] + e[i]\n \nelif len(o) >= len(e):\n  for i in range(0, len(e)):\n    p += o[i] + e[i]\n  p += o[-1]\n \nprint(p)", "passed": true, "time": 0.14, "memory": 14088.0, "status": "done"}, {"code": "o = input()\ne = input()\nl = []\nif len(o)-len(e) == 1:\n  for i in range(len(e)):\n    l.append(o[i])\n    l.append(e[i])\n  l.append(o[-1])\nelse:\n  for i in range(len(o)):\n    l.append(o[i])\n    l.append(e[i])\nprint(\"\".join(l))", "passed": true, "time": 0.14, "memory": 14252.0, "status": "done"}, {"code": "o = input()\ne = input()\ns = \"\"\nfor i in range(len(e)):\n    s += o[i]\n    s += e[i]\nif len(o) == len(e):\n    print(s)\nelse :\n    s += o[-1]\n    print(s)", "passed": true, "time": 0.14, "memory": 14232.0, "status": "done"}, {"code": "o = input()\nt = input()\n\nans = \"\"\n\nfor i in range(min(len(o), len(t))):\n    ans += o[i] + t[i]\n\nif len(o) > len(t):\n    ans += o[-1]\nelif len(o) < len(t):\n    ans += t[-1]\nelse:\n    pass\n\nprint(ans)", "passed": true, "time": 0.14, "memory": 14184.0, "status": "done"}, {"code": "o = input()\ne = input()\n\npw = ''\nfor i in range(len(o)):\n    pw += o[i]\n    if i < len(e):\n        pw += e[i]\nprint(pw)", "passed": true, "time": 0.14, "memory": 14068.0, "status": "done"}, {"code": "O = list(input())\nlo = len(O)\nE = list(input())\nle = len(E)\nw = lo + le\n\nX = ['*']*w\nfor i in range(le):\n  X[2*i] =O[i]\n  X[2*i+1] = E[i]\nif lo > le:\n  X[-1] = O[-1]\n  \nprint(''.join(X))", "passed": true, "time": 0.14, "memory": 14316.0, "status": "done"}, {"code": "a=input()\nb=input()\nc=len(a)\nd=len(b)\nx=\"\"\nif c<=d:\n  for i in range(c):\n    x=x+a[i]\n    x=x+b[i]\n  print(x)\nif c>d:\n  for i in range(d):\n    x=x+a[i]\n    x=x+b[i]\n  x=x+a[len(a)-1]\n  print(x)", "passed": true, "time": 0.14, "memory": 14044.0, "status": "done"}, {"code": "o = list(input())\ne = list(input())\ns = []\nt = \"\"\nif len(o+e) % 2 == 0:\n    for i in range(int(len(o+e)/2)):\n        s.append(o[i]+e[i])\n    t = t.join(s)\nelse:\n    for i in range(int(len(o+e)/2)):\n        s.append(o[i]+e[i])\n    t = t.join(s)\n    t = t + o[int(len(o+e)/2)]\n\nprint(t)\n", "passed": true, "time": 0.13, "memory": 14140.0, "status": "done"}, {"code": "o = list(input())\ne = list(input()) + [\"\"]\nans = \"\".join(o + e for o, e in zip(o, e))\nprint(ans)", "passed": true, "time": 0.14, "memory": 14096.0, "status": "done"}, {"code": "#!/usr/bin/env python3\n\ndef main():\n    a = input()\n    b = input()\n    for i in range(len(a)):\n        print(a[i], end=\"\")\n        if i < len(b):\n            print(b[i], end=\"\")\n    print()\n\n\ndef __starting_point():\n    main()\n\n__starting_point()", "passed": true, "time": 0.24, "memory": 14192.0, "status": "done"}, {"code": "O = list(input())\nE = list(input())+['']\nprint(*[o+e for o,e in zip(O,E)], sep=\"\")\n", "passed": true, "time": 0.24, "memory": 14156.0, "status": "done"}, {"code": "O = input()\nE = input()\n\nans = \"\"\nwhile len(O)>0:\n  ans += O[:1]+E[:1]\n  O = O[1:]\n  E = E[1:]\nprint(ans)", "passed": true, "time": 0.14, "memory": 14196.0, "status": "done"}]