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

from collections import Counter

import heapq



n = int(eval(input()))

ss = []

for _ in range(n):

    ss.append(input().rstrip())

ctr = Counter(ss)

heap = [(-v, k) for k, v in list(ctr.items())]

heapq.heapify(heap)

maxv = heap[0][0]

while heap:

    c = heapq.heappop(heap)

    if c[0] != maxv:

        break

    print((c[1]))


# optimized version of the same code:

from collections import Counter



n = int(eval(input()))

ss = []

for _ in range(n):

    ss.append(input().rstrip())

ctr = Counter(ss)



a = sorted([(-v, k) for k, v in list(ctr.items())])

maxv = a[0][0]

for i in range(len(a)):

    if a[i][0] != maxv:

        break

    print((a[i][1]))
from collections import Counter
import heapq

n = int(eval(input()))
ss = []
for _ in range(n):
    ss.append(input().rstrip())
ctr = Counter(ss)
heap = [(-v, k) for k, v in list(ctr.items())]
heapq.heapify(heap)
maxv = heap[0][0]
while heap:
    c = heapq.heappop(heap)
    if c[0] != maxv:
        break
    print((c[1]))

from collections import Counter

n = int(eval(input()))
ss = []
for _ in range(n):
    ss.append(input().rstrip())
ctr = Counter(ss)
a = sorted([(-v, k) for k, v in list(ctr.items())])
maxv = a[0][0]
for i in range(len(a)):
    if a[i][0] != maxv:
        break
    print((a[i][1]))

-import heapq -heap = [(-v, k) for k, v in list(ctr.items())] -heapq.heapify(heap) -maxv = heap[0][0] -while heap: -    c = heapq.heappop(heap) -    if c[0] != maxv: +a = sorted([(-v, k) for k, v in list(ctr.items())]) +maxv = a[0][0] +for i in range(len(a)): +    if a[i][0] != maxv: -    print((c[1])) +    print((a[i][1]))