
# 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 numpy as np

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

exp=tuple([(int(x)+1)/2 for x in input().split()])

l=np.cumsum(exp)



ans=l[k-1]

for i in range(0,n-k):

  x=l[i+k]-l[i]

  ans=max(ans,x)

print(ans)

# optimized version of the same code:

def main():

    from itertools import accumulate

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

    *exp, = [(int(x) + 1) / 2 for x in input().split()]

    l = accumulate(exp)

    l = list(l)

    ans = l[k - 1]

    for i in range(0, n - k):

        x = l[i + k] - l[i]

        ans = max(ans, x)

    print(ans)





if __name__ == '__main__':

    main()

import numpy as np

n, k = list(map(int, input().split()))
exp = tuple([(int(x) + 1) / 2 for x in input().split()])
l = np.cumsum(exp)
ans = l[k - 1]
for i in range(0, n - k):
    x = l[i + k] - l[i]
    ans = max(ans, x)
print(ans)

def main():
    from itertools import accumulate

    n, k = list(map(int, input().split()))
    (*exp,) = [(int(x) + 1) / 2 for x in input().split()]
    l = accumulate(exp)
    l = list(l)
    ans = l[k - 1]
    for i in range(0, n - k):
        x = l[i + k] - l[i]
        ans = max(ans, x)
    print(ans)


if __name__ == "__main__":
    main()

-import numpy as np +def main(): +    from itertools import accumulate -n, k = list(map(int, input().split())) -exp = tuple([(int(x) + 1) / 2 for x in input().split()]) -l = np.cumsum(exp) -ans = l[k - 1] -for i in range(0, n - k): -    x = l[i + k] - l[i] -    ans = max(ans, x) -print(ans) +    n, k = list(map(int, input().split())) +    (*exp,) = [(int(x) + 1) / 2 for x in input().split()] +    l = accumulate(exp) +    l = list(l) +    ans = l[k - 1] +    for i in range(0, n - k): +        x = l[i + k] - l[i] +        ans = max(ans, x) +    print(ans) + + +if __name__ == "__main__": +    main()