
# 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 numpy as np



N = int(input())



A = np.array([int(i) for i in input().split()])



x = np.argsort(A)

x += 1



for i in range(N):

    print(x[i], end=" ")

    

print()


# optimized version of the same code:

N = int(eval(input()))



A = [int(i) for i in input().split()]



B = [0]*N

for i in range(N):

    B[A[i]-1] = i+1



for i in range(N):

    print((B[i]))

import numpy as np

N = int(input())
A = np.array([int(i) for i in input().split()])
x = np.argsort(A)
x += 1
for i in range(N):
    print(x[i], end=" ")
print()

N = int(eval(input()))
A = [int(i) for i in input().split()]
B = [0] * N
for i in range(N):
    B[A[i] - 1] = i + 1
for i in range(N):
    print((B[i]))

-import numpy as np - -N = int(input()) -A = np.array([int(i) for i in input().split()]) -x = np.argsort(A) -x += 1 +N = int(eval(input())) +A = [int(i) for i in input().split()] +B = [0] * N -    print(x[i], end=" ") -print() +    B[A[i] - 1] = i + 1 +for i in range(N): +    print((B[i]))