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

a,b,c,x,y=list(map(int,input().split()))



ans=a*x+b*y

for ci in range(max(x,y)+1):

    sumc = 2*ci*c

    sumc += (x-ci)*a if (x-ci)>0 else 0

    sumc += (y-ci)*b if (y-ci)>0 else 0

    ans=min(ans,sumc)



print(ans)

# optimized version of the same code:

a,b,c,x,y=list(map(int,input().split()))

ans=a*x+b*y

if x==y:

    ans=min(ans,2*x*c)

elif x>y:

    ans=min(ans,a*(x-y)+2*y*c)

    ans=min(ans,2*x*c)

else:

    ans=min(ans,b*(y-x)+2*x*c)

    ans=min(ans,2*y*c)

print(ans)
a, b, c, x, y = list(map(int, input().split()))
ans = a * x + b * y
for ci in range(max(x, y) + 1):
    sumc = 2 * ci * c
    sumc += (x - ci) * a if (x - ci) > 0 else 0
    sumc += (y - ci) * b if (y - ci) > 0 else 0
    ans = min(ans, sumc)
print(ans)

a, b, c, x, y = list(map(int, input().split()))
ans = a * x + b * y
if x == y:
    ans = min(ans, 2 * x * c)
elif x > y:
    ans = min(ans, a * (x - y) + 2 * y * c)
    ans = min(ans, 2 * x * c)
else:
    ans = min(ans, b * (y - x) + 2 * x * c)
    ans = min(ans, 2 * y * c)
print(ans)

-for ci in range(max(x, y) + 1): -    sumc = 2 * ci * c -    sumc += (x - ci) * a if (x - ci) > 0 else 0 -    sumc += (y - ci) * b if (y - ci) > 0 else 0 -    ans = min(ans, sumc) +if x == y: +    ans = min(ans, 2 * x * c) +elif x > y: +    ans = min(ans, a * (x - y) + 2 * y * c) +    ans = min(ans, 2 * x * c) +else: +    ans = min(ans, b * (y - x) + 2 * x * c) +    ans = min(ans, 2 * y * c)