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

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

a = list(map(int, input().split()))

d = [0] * n

d_max = 0



for i in range(n - 1):

    d[i] = a[i + 1] - a[i]

    d_max = max(d_max, d[i])



d[-1] = (k - a[-1]) + a[0]

d_max = max(d_max, d[-1])



print((k - d_max))


# optimized version of the same code:

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

a = list(map(int, input().split()))

d_max = 0



for i in range(n - 1):

    d = a[i + 1] - a[i]

    d_max = max(d_max, d)



d = (k - a[-1]) + a[0]

d_max = max(d_max, d)



print((k - d_max))

k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
d = [0] * n
d_max = 0
for i in range(n - 1):
    d[i] = a[i + 1] - a[i]
    d_max = max(d_max, d[i])
d[-1] = (k - a[-1]) + a[0]
d_max = max(d_max, d[-1])
print((k - d_max))

k, n = list(map(int, input().split()))
a = list(map(int, input().split()))
d_max = 0
for i in range(n - 1):
    d = a[i + 1] - a[i]
    d_max = max(d_max, d)
d = (k - a[-1]) + a[0]
d_max = max(d_max, d)
print((k - d_max))

-d = [0] * n -    d[i] = a[i + 1] - a[i] -    d_max = max(d_max, d[i]) -d[-1] = (k - a[-1]) + a[0] -d_max = max(d_max, d[-1]) +    d = a[i + 1] - a[i] +    d_max = max(d_max, d) +d = (k - a[-1]) + a[0] +d_max = max(d_max, d)