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

#ABC 130 B

N,X=list(map(int,input().split()))

L= [int(j) for j in input().split()]

cnt=0

import numpy as np

jump = list(np.cumsum(L))

for j in jump:

    if j <= X:

        cnt+=1

    else:

        break

print((cnt+1))

# optimized version of the same code:

#ABC 130 B

N,X=list(map(int,input().split()))

L= [int(j) for j in input().split()]

cnt=0

d = 0



for l in L :

    d+=l

    if d <= X:

        cnt+=1

    else:

        break

print((cnt+1))
# ABC 130 B
N, X = list(map(int, input().split()))
L = [int(j) for j in input().split()]
cnt = 0
import numpy as np

jump = list(np.cumsum(L))
for j in jump:
    if j <= X:
        cnt += 1
    else:
        break
print((cnt + 1))

# ABC 130 B
N, X = list(map(int, input().split()))
L = [int(j) for j in input().split()]
cnt = 0
d = 0
for l in L:
    d += l
    if d <= X:
        cnt += 1
    else:
        break
print((cnt + 1))

-import numpy as np - -jump = list(np.cumsum(L)) -for j in jump: -    if j <= X: +d = 0 +for l in L: +    d += l +    if d <= X: