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

mod = 2019

l, r = list(map(int, input().split()))



if r//mod - l//mod > 0:

  print((0))

else:

  l %= mod

  r %= mod

  ans = mod

  for i in range(l+1, r+1):

    for j in range(l, i):

      ans = min(i*j%mod, ans)

    if ans == 0:

      break

  print(ans)

# optimized version of the same code:

mod = 2019

l, r = list(map(int, input().split()))



if r//mod - l//mod > 0:

  print((0))

else:

  l %= mod

  r %= mod

  ans = mod

  for i in range(l, r):

    for j in range(i+1, r+1):

      ans = min(i*j%mod, ans)

    if ans == 0:

      break

  print(ans)
mod = 2019
l, r = list(map(int, input().split()))
if r // mod - l // mod > 0:
    print((0))
else:
    l %= mod
    r %= mod
    ans = mod
    for i in range(l + 1, r + 1):
        for j in range(l, i):
            ans = min(i * j % mod, ans)
        if ans == 0:
            break
    print(ans)

mod = 2019
l, r = list(map(int, input().split()))
if r // mod - l // mod > 0:
    print((0))
else:
    l %= mod
    r %= mod
    ans = mod
    for i in range(l, r):
        for j in range(i + 1, r + 1):
            ans = min(i * j % mod, ans)
        if ans == 0:
            break
    print(ans)

-    for i in range(l + 1, r + 1): -        for j in range(l, i): +    for i in range(l, r): +        for j in range(i + 1, r + 1):