
# 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

N = int(eval(input()))

div = []

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

    while i != 1:

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

            while i%d==0:

                i = i//d

                div.append(d)

C = Counter(div).most_common()

Ans = 1

for k,v in C:

    Ans = Ans*(v+1) % (10**9+7)



print(Ans)


# optimized version of the same code:

from collections import defaultdict

N = int(eval(input()))



F = [True]*(N+1)

F[0]=F[1]=False

P = []



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

    if F[i]==True:

        P.append(i)

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

            F[j]=False



dic = defaultdict(int)

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

    for p in P:

        while i%p==0:

            dic[p] += 1

            i = i//p

        if i==1:

            break



ans = 1

modulo = 10**9+7

for v in list(dic.values()):

    ans *= (v+1)

    ans %= modulo



print(ans)
from collections import Counter

N = int(eval(input()))
div = []
for i in range(2, N + 1):
    while i != 1:
        for d in range(2, i + 1):
            while i % d == 0:
                i = i // d
                div.append(d)
C = Counter(div).most_common()
Ans = 1
for k, v in C:
    Ans = Ans * (v + 1) % (10**9 + 7)
print(Ans)

from collections import defaultdict

N = int(eval(input()))
F = [True] * (N + 1)
F[0] = F[1] = False
P = []
for i in range(2, N + 1):
    if F[i] == True:
        P.append(i)
        for j in range(i * 2, N + 1, i):
            F[j] = False
dic = defaultdict(int)
for i in range(2, N + 1):
    for p in P:
        while i % p == 0:
            dic[p] += 1
            i = i // p
        if i == 1:
            break
ans = 1
modulo = 10**9 + 7
for v in list(dic.values()):
    ans *= v + 1
    ans %= modulo
print(ans)

-from collections import Counter +from collections import defaultdict -div = [] +F = [True] * (N + 1) +F[0] = F[1] = False +P = [] -    while i != 1: -        for d in range(2, i + 1): -            while i % d == 0: -                i = i // d -                div.append(d) -C = Counter(div).most_common() -Ans = 1 -for k, v in C: -    Ans = Ans * (v + 1) % (10**9 + 7) -print(Ans) +    if F[i] == True: +        P.append(i) +        for j in range(i * 2, N + 1, i): +            F[j] = False +dic = defaultdict(int) +for i in range(2, N + 1): +    for p in P: +        while i % p == 0: +            dic[p] += 1 +            i = i // p +        if i == 1: +            break +ans = 1 +modulo = 10**9 + 7 +for v in list(dic.values()): +    ans *= v + 1 +    ans %= modulo +print(ans)