
# slower version:

s = input()
for i in range(len(s)):
  if i%2 == 0:
    print(s[i], end = '')


# optimized version of the same code:

s = input()
ans = ''
for i in range(len(s)):
  if i % 2 == 0:
    ans += s[i]
print(ans)



# slower version:

import sys

read = sys.stdin.read

readline = sys.stdin.readline

readlines = sys.stdin.readlines



def main():

    S = readline().strip()

    T = readline().strip()



    idx_in_S = []

    last_idx = 0

    for t in T:

        t_idx = S.find(t, last_idx) + 1

        if t_idx:

            idx_in_S.append(t_idx)

            last_idx = t_idx

        else:

            t_idx = S.find(t, 0, last_idx) + 1

            if not t_idx:

                print((-1))

                exit()

            else:

                idx_in_S.append(t_idx)

                last_idx = t_idx



    

    rep = 0

    for i in range(len(T) - 1):

        if idx_in_S[i] < idx_in_S[i+1]:

            continue

        else:

            rep += 1



    ans = len(S) * rep + idx_in_S[-1]

    print(ans)





if __name__ == "__main__":

    main()


# optimized version of the same code:

# S.find()の部分を高速化する

from collections import defaultdict

from bisect import bisect_right

import sys

read = sys.stdin.read

readline = sys.stdin.readline

readlines = sys.stdin.readlines



def main():

    S = readline().strip()

    T = readline().strip()



    S_idx = defaultdict(list)

    for i, s in enumerate(S):

        S_idx[s].append(i)

    

    rep = 0

    last_idx = -1

    for t in T:

        t_idx_list = S_idx[t]

        if t_idx_list:

            t_idx = bisect_right(t_idx_list, last_idx)

            if t_idx < len(t_idx_list):

                last_idx = t_idx_list[t_idx]

            else:

                last_idx = t_idx_list[0]

                rep += 1

        else:

            print((-1))

            exit()

    

    ans = len(S) * rep + last_idx + 1

    print(ans)





if __name__ == "__main__":

    main()

import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines


def main():
    S = readline().strip()
    T = readline().strip()
    idx_in_S = []
    last_idx = 0
    for t in T:
        t_idx = S.find(t, last_idx) + 1
        if t_idx:
            idx_in_S.append(t_idx)
            last_idx = t_idx
        else:
            t_idx = S.find(t, 0, last_idx) + 1
            if not t_idx:
                print((-1))
                exit()
            else:
                idx_in_S.append(t_idx)
                last_idx = t_idx
    rep = 0
    for i in range(len(T) - 1):
        if idx_in_S[i] < idx_in_S[i + 1]:
            continue
        else:
            rep += 1
    ans = len(S) * rep + idx_in_S[-1]
    print(ans)


if __name__ == "__main__":
    main()

# S.find()の部分を高速化する
from collections import defaultdict
from bisect import bisect_right
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines


def main():
    S = readline().strip()
    T = readline().strip()
    S_idx = defaultdict(list)
    for i, s in enumerate(S):
        S_idx[s].append(i)
    rep = 0
    last_idx = -1
    for t in T:
        t_idx_list = S_idx[t]
        if t_idx_list:
            t_idx = bisect_right(t_idx_list, last_idx)
            if t_idx < len(t_idx_list):
                last_idx = t_idx_list[t_idx]
            else:
                last_idx = t_idx_list[0]
                rep += 1
        else:
            print((-1))
            exit()
    ans = len(S) * rep + last_idx + 1
    print(ans)


if __name__ == "__main__":
    main()

+# S.find()の部分を高速化する +from collections import defaultdict +from bisect import bisect_right -    idx_in_S = [] -    last_idx = 0 +    S_idx = defaultdict(list) +    for i, s in enumerate(S): +        S_idx[s].append(i) +    rep = 0 +    last_idx = -1 -        t_idx = S.find(t, last_idx) + 1 -        if t_idx: -            idx_in_S.append(t_idx) -            last_idx = t_idx +        t_idx_list = S_idx[t] +        if t_idx_list: +            t_idx = bisect_right(t_idx_list, last_idx) +            if t_idx < len(t_idx_list): +                last_idx = t_idx_list[t_idx] +            else: +                last_idx = t_idx_list[0] +                rep += 1 -            t_idx = S.find(t, 0, last_idx) + 1 -            if not t_idx: -                print((-1)) -                exit() -            else: -                idx_in_S.append(t_idx) -                last_idx = t_idx -    rep = 0 -    for i in range(len(T) - 1): -        if idx_in_S[i] < idx_in_S[i + 1]: -            continue -        else: -            rep += 1 -    ans = len(S) * rep + idx_in_S[-1] +            print((-1)) +            exit() +    ans = len(S) * rep + last_idx + 1