
# 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 functools import reduce

N = int(eval(input()))



prime_table = [1] * (N+1)



for x in range(2, N+1):

    for t in range(2, x+1):

        while x % t == 0:

            prime_table[t] += 1

            x //= t

print((reduce(lambda x, y: x * y % (int(1e9) + 7), prime_table)))

# optimized version of the same code:

def prime_factorize(n):

    while n % 2 == 0:

        a[2] += 1

        n //= 2

    f = 3

    while f * f <= n:

        if n % f == 0:

            a[f] += 1

            n //= f

        else:

            f += 2

    if n != 1:

        a[n] += 1



N = int(eval(input()))

a = [0]*(N+1)

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

    prime_factorize(i)

ans = 1

for i in a:

    if i > 0:

        ans *= (i+1)

big = 10**9 + 7

print((ans % big))
from functools import reduce

N = int(eval(input()))
prime_table = [1] * (N + 1)
for x in range(2, N + 1):
    for t in range(2, x + 1):
        while x % t == 0:
            prime_table[t] += 1
            x //= t
print((reduce(lambda x, y: x * y % (int(1e9) + 7), prime_table)))

def prime_factorize(n):
    while n % 2 == 0:
        a[2] += 1
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a[f] += 1
            n //= f
        else:
            f += 2
    if n != 1:
        a[n] += 1


N = int(eval(input()))
a = [0] * (N + 1)
for i in range(2, N + 1):
    prime_factorize(i)
ans = 1
for i in a:
    if i > 0:
        ans *= i + 1
big = 10**9 + 7
print((ans % big))

-from functools import reduce +def prime_factorize(n): +    while n % 2 == 0: +        a[2] += 1 +        n //= 2 +    f = 3 +    while f * f <= n: +        if n % f == 0: +            a[f] += 1 +            n //= f +        else: +            f += 2 +    if n != 1: +        a[n] += 1 + -prime_table = [1] * (N + 1) -for x in range(2, N + 1): -    for t in range(2, x + 1): -        while x % t == 0: -            prime_table[t] += 1 -            x //= t -print((reduce(lambda x, y: x * y % (int(1e9) + 7), prime_table))) +a = [0] * (N + 1) +for i in range(2, N + 1): +    prime_factorize(i) +ans = 1 +for i in a: +    if i > 0: +        ans *= i + 1 +big = 10**9 + 7 +print((ans % big))