
# 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 collections as col



def prime(n):

    ans = []

    num = n

    for i in range(2,n+1):

        if i%2==0 and i!=2: continue

        while num%i == 0: num //= i ; ans.append(i)

    return ans



n = int(eval(input()))

mod = 10**9 + 7



primes = []

for i in range(2,n+1): primes += prime(i)



cnt = col.Counter(primes)

ans = 1

for key,val in list(cnt.items()): ans *= (val + 1) ; ans %= mod

print(ans)


# optimized version of the same code:

import collections as col



def prime(n):

    ans = []

    num = n

    for i in range(2,int(n**0.5)+1):

        if i%2==0 and i!=2: continue

        while num%i == 0: num //= i ; ans.append(i)

    if num != 1: ans.append(num)

    return ans



n = int(eval(input()))

mod = 10**9 + 7



primes = []

for i in range(2,n+1): primes += prime(i)



cnt = col.Counter(primes)

ans = 1

for key,val in list(cnt.items()): ans *= (val + 1) ; ans %= mod

print(ans)

import collections as col


def prime(n):
    ans = []
    num = n
    for i in range(2, n + 1):
        if i % 2 == 0 and i != 2:
            continue
        while num % i == 0:
            num //= i
            ans.append(i)
    return ans


n = int(eval(input()))
mod = 10**9 + 7
primes = []
for i in range(2, n + 1):
    primes += prime(i)
cnt = col.Counter(primes)
ans = 1
for key, val in list(cnt.items()):
    ans *= val + 1
    ans %= mod
print(ans)

import collections as col


def prime(n):
    ans = []
    num = n
    for i in range(2, int(n**0.5) + 1):
        if i % 2 == 0 and i != 2:
            continue
        while num % i == 0:
            num //= i
            ans.append(i)
    if num != 1:
        ans.append(num)
    return ans


n = int(eval(input()))
mod = 10**9 + 7
primes = []
for i in range(2, n + 1):
    primes += prime(i)
cnt = col.Counter(primes)
ans = 1
for key, val in list(cnt.items()):
    ans *= val + 1
    ans %= mod
print(ans)

-    for i in range(2, n + 1): +    for i in range(2, int(n**0.5) + 1): +    if num != 1: +        ans.append(num)