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

n = int(eval(input()))



felicidade = []



for x in range(n):

    felicidade.append(list(map(int,input().split())))



DP = [0,0,0]



if n == 1:

    print((max(felicidade[0])))



else:



    for x in range(3):

        DP[x] = felicidade[0][x]





    for dia in range(1,n):

        m = [0] * 3

        for x  in range(3):#As duas possíveis escolhas são x e y

            for y  in range(3):

                if x != y: #Se elas forem diferentes

                    m[x] = max(m[x], DP[y] + felicidade[dia][x])

        DP = m

    

    print((max(DP)))


# optimized version of the same code:

nDays = int(eval(input()))



today = [int(x) for x in input().split()]



for i in range(nDays - 1):

    tomorrow = [int(x) for x in input().split()]

    tomorrow[0] += max(today[1], today[2])

    tomorrow[1] += max(today[0], today[2])

    tomorrow[2] += max(today[0], today[1])

    today = tomorrow



print((max(today)))
n = int(eval(input()))
felicidade = []
for x in range(n):
    felicidade.append(list(map(int, input().split())))
DP = [0, 0, 0]
if n == 1:
    print((max(felicidade[0])))
else:
    for x in range(3):
        DP[x] = felicidade[0][x]
    for dia in range(1, n):
        m = [0] * 3
        for x in range(3):  # As duas possíveis escolhas são x e y
            for y in range(3):
                if x != y:  # Se elas forem diferentes
                    m[x] = max(m[x], DP[y] + felicidade[dia][x])
        DP = m
    print((max(DP)))

nDays = int(eval(input()))
today = [int(x) for x in input().split()]
for i in range(nDays - 1):
    tomorrow = [int(x) for x in input().split()]
    tomorrow[0] += max(today[1], today[2])
    tomorrow[1] += max(today[0], today[2])
    tomorrow[2] += max(today[0], today[1])
    today = tomorrow
print((max(today)))

-n = int(eval(input())) -felicidade = [] -for x in range(n): -    felicidade.append(list(map(int, input().split()))) -DP = [0, 0, 0] -if n == 1: -    print((max(felicidade[0]))) -else: -    for x in range(3): -        DP[x] = felicidade[0][x] -    for dia in range(1, n): -        m = [0] * 3 -        for x in range(3):  # As duas possíveis escolhas são x e y -            for y in range(3): -                if x != y:  # Se elas forem diferentes -                    m[x] = max(m[x], DP[y] + felicidade[dia][x]) -        DP = m -    print((max(DP))) +nDays = int(eval(input())) +today = [int(x) for x in input().split()] +for i in range(nDays - 1): +    tomorrow = [int(x) for x in input().split()] +    tomorrow[0] += max(today[1], today[2]) +    tomorrow[1] += max(today[0], today[2]) +    tomorrow[2] += max(today[0], today[1]) +    today = tomorrow +print((max(today)))