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

# https://atcoder.jp/contests/dp/tasks/dp_c

import numpy as np

N = int(eval(input()))

Max_List=[]

N_List=[i for i in range(3)]

for i in range(N):

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

    if i == 0:

        Max_List.append(Current_List)

    else:

        Current_Max_List = []

        for j in range(3):

            Index_List=np.array(Max_List[i-1])

            ind = np.ones(3, dtype=bool)

            ind[j] = False

            Current_Max_List.append(max(Index_List[ind])+Current_List[j])

            

        Max_List.append(Current_Max_List)

        

    

print((max(Max_List[-1])))

# optimized version of the same code:

# https://atcoder.jp/contests/dp/tasks/dp_c

N = int(eval(input()))

Max_List=[]

N_List=[i for i in range(3)]

for i in range(N):

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

    if i == 0:

        Max_List.append(Current_List)

    else:

        Current_Max_List = []

        Search_List=Max_List[i-1]

        for j in range(3):

            Current_Search_List=Search_List[1:3]

            Current_Max_List.append(max(Current_Search_List)+Current_List[j])

            Search_List.append(Search_List[0])

            del Search_List[0]

        Max_List.append(Current_Max_List)

        

    

print((max(Max_List[-1])))
# https://atcoder.jp/contests/dp/tasks/dp_c
import numpy as np

N = int(eval(input()))
Max_List = []
N_List = [i for i in range(3)]
for i in range(N):
    Current_List = list(map(int, input().split()))
    if i == 0:
        Max_List.append(Current_List)
    else:
        Current_Max_List = []
        for j in range(3):
            Index_List = np.array(Max_List[i - 1])
            ind = np.ones(3, dtype=bool)
            ind[j] = False
            Current_Max_List.append(max(Index_List[ind]) + Current_List[j])
        Max_List.append(Current_Max_List)
print((max(Max_List[-1])))

# https://atcoder.jp/contests/dp/tasks/dp_c
N = int(eval(input()))
Max_List = []
N_List = [i for i in range(3)]
for i in range(N):
    Current_List = list(map(int, input().split()))
    if i == 0:
        Max_List.append(Current_List)
    else:
        Current_Max_List = []
        Search_List = Max_List[i - 1]
        for j in range(3):
            Current_Search_List = Search_List[1:3]
            Current_Max_List.append(max(Current_Search_List) + Current_List[j])
            Search_List.append(Search_List[0])
            del Search_List[0]
        Max_List.append(Current_Max_List)
print((max(Max_List[-1])))

-import numpy as np - +        Search_List = Max_List[i - 1] -            Index_List = np.array(Max_List[i - 1]) -            ind = np.ones(3, dtype=bool) -            ind[j] = False -            Current_Max_List.append(max(Index_List[ind]) + Current_List[j]) +            Current_Search_List = Search_List[1:3] +            Current_Max_List.append(max(Current_Search_List) + Current_List[j]) +            Search_List.append(Search_List[0]) +            del Search_List[0]