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



n,m,k = list(map(int,input().split()))

#１回押すと変わるマス　= N * M -1

#２回目押すと黒に変わるマス N * M -1 -2

# 3 = N * M -1 -4



cnt = 0

for i in range(n+1):

    for j in range(m + 1):

        cnt = i * m + j * n -2 * i * j

        if cnt == k:

            print("Yes")

            exit()

print("No")


# optimized version of the same code:



n,m,k = list(map(int,input().split()))



for i in range(n+1):

    for j in range(m+1):

        if i*(m-j) + j*(n-i) == k:

            print("Yes")

            exit()

print("No")

n, m, k = list(map(int, input().split()))
# １回押すと変わるマス　= N * M -1
# ２回目押すと黒に変わるマス N * M -1 -2
# 3 = N * M -1 -4
cnt = 0
for i in range(n + 1):
    for j in range(m + 1):
        cnt = i * m + j * n - 2 * i * j
        if cnt == k:
            print("Yes")
            exit()
print("No")

n, m, k = list(map(int, input().split()))
for i in range(n + 1):
    for j in range(m + 1):
        if i * (m - j) + j * (n - i) == k:
            print("Yes")
            exit()
print("No")

-# １回押すと変わるマス　= N * M -1 -# ２回目押すと黒に変わるマス N * M -1 -2 -# 3 = N * M -1 -4 -cnt = 0 -        cnt = i * m + j * n - 2 * i * j -        if cnt == k: +        if i * (m - j) + j * (n - i) == k: