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

N, K = list(map(int, input().split()))

S = eval(input())

nums = []

now = 1

cnt = 0

for i in range(N):

    if S[i] == str(now):

        cnt += 1

    else:

        nums.append(cnt)

        now = 1 - now

        cnt = 1

if cnt != 0:

    nums.append(cnt)

if len(nums) % 2 == 0:

    nums.append(0)



add = 2 * K + 1

ans = 0

left = 0

right = 0

tmp = 0

for i in range(0, len(nums), 2):



    next_left = i

    next_right = min(i + add, len(nums))



    while next_left > left:

        tmp -= nums[left]

        left += 1



    while next_right > right:

        tmp += nums[right]

        right += 1



    ans = max(ans, tmp)

print(ans)

# optimized version of the same code:

N, K = list(map(int, input().split()))

S = eval(input())

nums = []

now = 1

cnt = 0

for i in range(N):

    if S[i] == str(now):

        cnt += 1

    else:

        nums.append(cnt)

        now = 1 - now

        cnt = 1

if cnt != 0:

    nums.append(cnt)

if len(nums) % 2 == 0:

    nums.append(0)



csum = [0] * (len(nums) + 1)

for i in range(len(nums)):

    csum[i + 1] = csum[i] + nums[i]



add = 2 * K + 1

ans = 0

tmp = 0

for i in range(0, len(nums), 2):

    left = i

    right = min(i + add, len(nums))

    tmp = csum[right] - csum[left]

    ans = max(ans, tmp)

print(ans)
N, K = list(map(int, input().split()))
S = eval(input())
nums = []
now = 1
cnt = 0
for i in range(N):
    if S[i] == str(now):
        cnt += 1
    else:
        nums.append(cnt)
        now = 1 - now
        cnt = 1
if cnt != 0:
    nums.append(cnt)
if len(nums) % 2 == 0:
    nums.append(0)
add = 2 * K + 1
ans = 0
left = 0
right = 0
tmp = 0
for i in range(0, len(nums), 2):
    next_left = i
    next_right = min(i + add, len(nums))
    while next_left > left:
        tmp -= nums[left]
        left += 1
    while next_right > right:
        tmp += nums[right]
        right += 1
    ans = max(ans, tmp)
print(ans)

N, K = list(map(int, input().split()))
S = eval(input())
nums = []
now = 1
cnt = 0
for i in range(N):
    if S[i] == str(now):
        cnt += 1
    else:
        nums.append(cnt)
        now = 1 - now
        cnt = 1
if cnt != 0:
    nums.append(cnt)
if len(nums) % 2 == 0:
    nums.append(0)
csum = [0] * (len(nums) + 1)
for i in range(len(nums)):
    csum[i + 1] = csum[i] + nums[i]
add = 2 * K + 1
ans = 0
tmp = 0
for i in range(0, len(nums), 2):
    left = i
    right = min(i + add, len(nums))
    tmp = csum[right] - csum[left]
    ans = max(ans, tmp)
print(ans)

+csum = [0] * (len(nums) + 1) +for i in range(len(nums)): +    csum[i + 1] = csum[i] + nums[i] -left = 0 -right = 0 -    next_left = i -    next_right = min(i + add, len(nums)) -    while next_left > left: -        tmp -= nums[left] -        left += 1 -    while next_right > right: -        tmp += nums[right] -        right += 1 +    left = i +    right = min(i + add, len(nums)) +    tmp = csum[right] - csum[left]