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

ab = c * 2



res = float("inf")

if a + b <= ab:

    res = x * a + y * b

else:

    if x == y:

        res = x * ab

    elif x > y:

        for i in range(y, x + 1):

            cost = i * ab + (x - i) * a

            res = min(res, cost)

    else:

        for i in range(x, y + 1):

            cost = i * ab + (y - i) * b

            res = min(res, cost)

print(res)


# optimized version of the same code:

import sys



sys.setrecursionlimit(10 ** 7)

input = sys.stdin.readline

f_inf = float('inf')

mod = 10 ** 9 + 7





def resolve():

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

    c *= 2

    if a + b > c:

        cost1 = max(x, y) * c

        cost2 = min(x, y) * c

        plus = ((y - x) * b) if x < y else (x - y) * a

        res = min(cost1, cost2 + plus)

    else:

        res = x * a + y * b

    print(res)



if __name__ == '__main__':

    resolve()

a, b, c, x, y = list(map(int, input().split()))
ab = c * 2
res = float("inf")
if a + b <= ab:
    res = x * a + y * b
else:
    if x == y:
        res = x * ab
    elif x > y:
        for i in range(y, x + 1):
            cost = i * ab + (x - i) * a
            res = min(res, cost)
    else:
        for i in range(x, y + 1):
            cost = i * ab + (y - i) * b
            res = min(res, cost)
print(res)

import sys

sys.setrecursionlimit(10**7)
input = sys.stdin.readline
f_inf = float("inf")
mod = 10**9 + 7


def resolve():
    a, b, c, x, y = list(map(int, input().split()))
    c *= 2
    if a + b > c:
        cost1 = max(x, y) * c
        cost2 = min(x, y) * c
        plus = ((y - x) * b) if x < y else (x - y) * a
        res = min(cost1, cost2 + plus)
    else:
        res = x * a + y * b
    print(res)


if __name__ == "__main__":
    resolve()

-a, b, c, x, y = list(map(int, input().split())) -ab = c * 2 -res = float("inf") -if a + b <= ab: -    res = x * a + y * b -else: -    if x == y: -        res = x * ab -    elif x > y: -        for i in range(y, x + 1): -            cost = i * ab + (x - i) * a -            res = min(res, cost) +import sys + +sys.setrecursionlimit(10**7) +input = sys.stdin.readline +f_inf = float("inf") +mod = 10**9 + 7 + + +def resolve(): +    a, b, c, x, y = list(map(int, input().split())) +    c *= 2 +    if a + b > c: +        cost1 = max(x, y) * c +        cost2 = min(x, y) * c +        plus = ((y - x) * b) if x < y else (x - y) * a +        res = min(cost1, cost2 + plus) -        for i in range(x, y + 1): -            cost = i * ab + (y - i) * b -            res = min(res, cost) -print(res) +        res = x * a + y * b +    print(res) + + +if __name__ == "__main__": +    resolve()