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

n,k = list(map(int,input().split()))

ai = [int(i) for i in input().split()]



old_ai = ai

cnt = 0



while 1 == 1:

    old_ai = copy.deepcopy(ai)

    li = [0]*(n+1)

    for i in range(n):

        li[max(0,i-ai[i])] += 1

        li[min(n,i+1+ai[i])] -= 1

        #print(li)

    #print(li)

    tmp = 0

    for i in range(n):

        if i == 0:

            ai[i] = li[i]

            tmp += ai[i]

        else:

            ai[i] = li[i] + ai[i-1]

            tmp += ai[i]

    #print(rui)

    if ai == old_ai:

        print((*ai))

        exit()

        break

    cnt += 1

    if cnt == k:

        print((*ai))

        exit()

    old_ai = ai

# optimized version of the same code:

import copy

n,k = list(map(int,input().split()))

ai = [int(i) for i in input().split()]



#old_ai = ai

cnt = 0

old_tmp = sum(ai)



while 1 == 1:

    #old_ai = copy.deepcopy(ai)

    li = [0]*(n+1)

    for i in range(n):

        li[max(0,i-ai[i])] += 1

        li[min(n,i+1+ai[i])] -= 1

        #print(li)

    #print(li)

    tmp = 0

    for i in range(n):

        if i == 0:

            ai[i] = li[i]

            tmp += ai[i]

        else:

            ai[i] = li[i] + ai[i-1]

            tmp += ai[i]

    #print(rui)

    if old_tmp == tmp:

        print((*ai))

        exit()

        break

    cnt += 1

    if cnt == k:

        print((*ai))

        exit()

    old_tmp = tmp
import copy

n, k = list(map(int, input().split()))
ai = [int(i) for i in input().split()]
old_ai = ai
cnt = 0
while 1 == 1:
    old_ai = copy.deepcopy(ai)
    li = [0] * (n + 1)
    for i in range(n):
        li[max(0, i - ai[i])] += 1
        li[min(n, i + 1 + ai[i])] -= 1
        # print(li)
    # print(li)
    tmp = 0
    for i in range(n):
        if i == 0:
            ai[i] = li[i]
            tmp += ai[i]
        else:
            ai[i] = li[i] + ai[i - 1]
            tmp += ai[i]
    # print(rui)
    if ai == old_ai:
        print((*ai))
        exit()
        break
    cnt += 1
    if cnt == k:
        print((*ai))
        exit()
    old_ai = ai

import copy

n, k = list(map(int, input().split()))
ai = [int(i) for i in input().split()]
# old_ai = ai
cnt = 0
old_tmp = sum(ai)
while 1 == 1:
    # old_ai = copy.deepcopy(ai)
    li = [0] * (n + 1)
    for i in range(n):
        li[max(0, i - ai[i])] += 1
        li[min(n, i + 1 + ai[i])] -= 1
        # print(li)
    # print(li)
    tmp = 0
    for i in range(n):
        if i == 0:
            ai[i] = li[i]
            tmp += ai[i]
        else:
            ai[i] = li[i] + ai[i - 1]
            tmp += ai[i]
    # print(rui)
    if old_tmp == tmp:
        print((*ai))
        exit()
        break
    cnt += 1
    if cnt == k:
        print((*ai))
        exit()
    old_tmp = tmp

-old_ai = ai +# old_ai = ai +old_tmp = sum(ai) -    old_ai = copy.deepcopy(ai) +    # old_ai = copy.deepcopy(ai) -    if ai == old_ai: +    if old_tmp == tmp: -    old_ai = ai +    old_tmp = tmp