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

s=eval(input())

t=eval(input())

s*=2

next=[[-1]*26 for _ in range(len(s))]

alph=[[]for _ in range(26)]

for i in range(len(s)):

	alph[ord(s[i])-ord("a")].append(i)

from bisect import bisect_right

for i in range(len(s)//2):

	for j in range(26):

		if len(alph[j])>bisect_right(alph[j],i):

			next[i][j]=alph[j][bisect_right(alph[j],i)]

ans=1

now=len(s)//2-1

for x in t:

	r=ord(x)-ord("a")

	now=next[now][r]

	if now==-1:

		print((-1))

		exit()

	if now>=len(s)//2:

		ans+=len(s)//2

		now-=len(s)//2

print((ans+now-len(s)//2))

# optimized version of the same code:

#O(|S|log|s|)

def main():

	s=eval(input())

	t=eval(input())

	n=len(s)

	now=-1

	ans=1

	if not set(t)<=set(s):#tがsの部分集合でない

		print((-1))

		exit()

	for x in t:

		now=s.find(x,now+1)#nowより大きいところからxを探す

		if now==-1:#nowより大きいところでxが見つからなかったら

			ans+=n

			now=s.find(x)

	print((ans+now))

if __name__ == '__main__':

	main()
s = eval(input())
t = eval(input())
s *= 2
next = [[-1] * 26 for _ in range(len(s))]
alph = [[] for _ in range(26)]
for i in range(len(s)):
    alph[ord(s[i]) - ord("a")].append(i)
from bisect import bisect_right

for i in range(len(s) // 2):
    for j in range(26):
        if len(alph[j]) > bisect_right(alph[j], i):
            next[i][j] = alph[j][bisect_right(alph[j], i)]
ans = 1
now = len(s) // 2 - 1
for x in t:
    r = ord(x) - ord("a")
    now = next[now][r]
    if now == -1:
        print((-1))
        exit()
    if now >= len(s) // 2:
        ans += len(s) // 2
        now -= len(s) // 2
print((ans + now - len(s) // 2))

# O(|S|log|s|)
def main():
    s = eval(input())
    t = eval(input())
    n = len(s)
    now = -1
    ans = 1
    if not set(t) <= set(s):  # tがsの部分集合でない
        print((-1))
        exit()
    for x in t:
        now = s.find(x, now + 1)  # nowより大きいところからxを探す
        if now == -1:  # nowより大きいところでxが見つからなかったら
            ans += n
            now = s.find(x)
    print((ans + now))


if __name__ == "__main__":
    main()

-s = eval(input()) -t = eval(input()) -s *= 2 -next = [[-1] * 26 for _ in range(len(s))] -alph = [[] for _ in range(26)] -for i in range(len(s)): -    alph[ord(s[i]) - ord("a")].append(i) -from bisect import bisect_right - -for i in range(len(s) // 2): -    for j in range(26): -        if len(alph[j]) > bisect_right(alph[j], i): -            next[i][j] = alph[j][bisect_right(alph[j], i)] -ans = 1 -now = len(s) // 2 - 1 -for x in t: -    r = ord(x) - ord("a") -    now = next[now][r] -    if now == -1: +# O(|S|log|s|) +def main(): +    s = eval(input()) +    t = eval(input()) +    n = len(s) +    now = -1 +    ans = 1 +    if not set(t) <= set(s):  # tがsの部分集合でない -    if now >= len(s) // 2: -        ans += len(s) // 2 -        now -= len(s) // 2 -print((ans + now - len(s) // 2)) +    for x in t: +        now = s.find(x, now + 1)  # nowより大きいところからxを探す +        if now == -1:  # nowより大きいところでxが見つからなかったら +            ans += n +            now = s.find(x) +    print((ans + now)) + + +if __name__ == "__main__": +    main()