
# 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



def ABC133C(l, r):

    Min = np.inf

    for i in range(l, r):

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

            a = (i * j) % 2019

            if a < Min:

                Min = a

                if a == 0: # ここに注目

                    print(Min)

                    return

    print(Min)



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

ABC133C(l, r)


# optimized version of the same code:

def ABC133C(l, r):

    Min = 1e10

    for i in range(l, r):

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

            a = (i * j) % 2019

            if a < Min:

                Min = a

                if a == 0: # ここに注目

                    print(Min)

                    return

    print(Min)



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

ABC133C(l, r)

import numpy as np


def ABC133C(l, r):
    Min = np.inf
    for i in range(l, r):
        for j in range(i + 1, r + 1):
            a = (i * j) % 2019
            if a < Min:
                Min = a
                if a == 0:  # ここに注目
                    print(Min)
                    return
    print(Min)


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

def ABC133C(l, r):
    Min = 1e10
    for i in range(l, r):
        for j in range(i + 1, r + 1):
            a = (i * j) % 2019
            if a < Min:
                Min = a
                if a == 0:  # ここに注目
                    print(Min)
                    return
    print(Min)


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

-import numpy as np - - -    Min = np.inf +    Min = 1e10