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

#coding: UTF-8

import math

N=int(eval(input()))

def prime_list(k):

    lis=[True for i in range(1,k+1)]

    lis[0]=False

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

        j=2

        while j*j<=i:

            if i%j==0:

                lis[i-1]=False

                break

            else:

                j+=1

    return lis

#    print(lis)

def p_fact(k,N):

    plist=prime_list(k)

    lis=[0]*N

    for i in range(0,k):

        n=0

        if plist[i]:

            while k%(i+1)==0:

                n+=1

                k=k/(i+1)

        lis[i]=n

    return lis

out_lis=[0]*N

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

    input_lis=p_fact(i,N)

    out_lis=[out_lis[j]+input_lis[j] for j in range(0,N)]

#print(out_lis)

out=1

for i in range(0,N):

    out=out*(out_lis[i]+1)

print((out%1000000007))

# optimized version of the same code:

#coding: UTF-8

import math

N=int(eval(input()))

def prime_list(k):

    lis=[True for i in range(1,k+1)]

    lis[0]=False

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

        j=2

        while j*j<=i:

            if i%j==0:

                lis[i-1]=False

                break

            else:

                j+=1

    return lis

#    print(lis)

def p_fact(k,N,plist):

#    plist=prime_list(k)

    lis=[0]*N

    for i in range(0,k):

        n=0

        if plist[i]:

            while k%(i+1)==0:

                n+=1

                k=k/(i+1)

        lis[i]=n

    return lis

#    print(lis)

out_lis=[0]*N

plist=prime_list(N)

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

    input_lis=p_fact(i,N,plist)

    out_lis=[out_lis[j]+input_lis[j] for j in range(0,N)]

#print(out_lis)

out=1

for i in range(0,N):

    out=out*(out_lis[i]+1)

#print(out%1000000007)

print((out%(10**9+7)))
# coding: UTF-8
import math

N = int(eval(input()))


def prime_list(k):
    lis = [True for i in range(1, k + 1)]
    lis[0] = False
    for i in range(2, k + 1):
        j = 2
        while j * j <= i:
            if i % j == 0:
                lis[i - 1] = False
                break
            else:
                j += 1
    return lis


#    print(lis)
def p_fact(k, N):
    plist = prime_list(k)
    lis = [0] * N
    for i in range(0, k):
        n = 0
        if plist[i]:
            while k % (i + 1) == 0:
                n += 1
                k = k / (i + 1)
        lis[i] = n
    return lis


out_lis = [0] * N
for i in range(1, N + 1):
    input_lis = p_fact(i, N)
    out_lis = [out_lis[j] + input_lis[j] for j in range(0, N)]
# print(out_lis)
out = 1
for i in range(0, N):
    out = out * (out_lis[i] + 1)
print((out % 1000000007))

# coding: UTF-8
import math

N = int(eval(input()))


def prime_list(k):
    lis = [True for i in range(1, k + 1)]
    lis[0] = False
    for i in range(2, k + 1):
        j = 2
        while j * j <= i:
            if i % j == 0:
                lis[i - 1] = False
                break
            else:
                j += 1
    return lis


#    print(lis)
def p_fact(k, N, plist):
    #    plist=prime_list(k)
    lis = [0] * N
    for i in range(0, k):
        n = 0
        if plist[i]:
            while k % (i + 1) == 0:
                n += 1
                k = k / (i + 1)
        lis[i] = n
    return lis


#    print(lis)
out_lis = [0] * N
plist = prime_list(N)
for i in range(1, N + 1):
    input_lis = p_fact(i, N, plist)
    out_lis = [out_lis[j] + input_lis[j] for j in range(0, N)]
# print(out_lis)
out = 1
for i in range(0, N):
    out = out * (out_lis[i] + 1)
# print(out%1000000007)
print((out % (10**9 + 7)))

-def p_fact(k, N): -    plist = prime_list(k) +def p_fact(k, N, plist): +    #    plist=prime_list(k) +#    print(lis) +plist = prime_list(N) -    input_lis = p_fact(i, N) +    input_lis = p_fact(i, N, plist) -print((out % 1000000007)) +# print(out%1000000007) +print((out % (10**9 + 7)))