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

# coding: utf-8

import numpy as np





def solve(*args: str) -> str:

    n = int(args[0])

    LR = [tuple(map(int, a.split())) for a in args[1:]]

    L, R = list(zip(*LR))



    ret = 0



    p, q = np.argmax(L), np.argmin(R)

    lp, rq = L[p], R[q]



    ret = max(0, 1+rq-lp) + max(0, max(1+r-l for l, r in LR))



    AB = [[max(0, 1+r-lp), max(0, 1+rq-l)] for l, r in LR]

    AB.sort(key=lambda x: (x[0], -x[1]))

    A, B = list(map(list, list(zip(*AB))))



    # for i in range(1, n):

    #     ret = max(ret, min(A[i:]) + min(B[:i]))

    b_min = 1+10**9

    for i in range(n-1):

        b_min = min(b_min, B[i])

        ret = max(ret, b_min + A[i+1])



    return str(ret)





if __name__ == "__main__":

    print((solve(*(open(0).read().splitlines()))))


# optimized version of the same code:

# coding: utf-8





def solve(*args: str) -> str:

    n = int(args[0])

    LR = [tuple(map(int, a.split())) for a in args[1:]]

    L, R = list(zip(*LR))



    ret = 0



    # lp, rq = max(L), min(R)

    lp, rq = 0, 1+10**9

    for l, r in LR:

        lp, rq = max(lp, l), min(rq, r)



    ret = max(0, 1+rq-lp) + max(0, max(1+r-l for l, r in LR))



    AB = [[max(0, 1+r-lp), max(0, 1+rq-l)] for l, r in LR]

    AB.sort(key=lambda x: (x[0], -x[1]))

    A, B = list(map(list, list(zip(*AB))))



    # for i in range(1, n):

    #     ret = max(ret, min(A[i:]) + min(B[:i]))

    b_min = 1+10**9

    for i in range(n-1):

        b_min = min(b_min, B[i])

        ret = max(ret, b_min + A[i+1])



    return str(ret)





if __name__ == "__main__":

    print((solve(*(open(0).read().splitlines()))))

# coding: utf-8
import numpy as np


def solve(*args: str) -> str:
    n = int(args[0])
    LR = [tuple(map(int, a.split())) for a in args[1:]]
    L, R = list(zip(*LR))
    ret = 0
    p, q = np.argmax(L), np.argmin(R)
    lp, rq = L[p], R[q]
    ret = max(0, 1 + rq - lp) + max(0, max(1 + r - l for l, r in LR))
    AB = [[max(0, 1 + r - lp), max(0, 1 + rq - l)] for l, r in LR]
    AB.sort(key=lambda x: (x[0], -x[1]))
    A, B = list(map(list, list(zip(*AB))))
    # for i in range(1, n):
    #     ret = max(ret, min(A[i:]) + min(B[:i]))
    b_min = 1 + 10**9
    for i in range(n - 1):
        b_min = min(b_min, B[i])
        ret = max(ret, b_min + A[i + 1])
    return str(ret)


if __name__ == "__main__":
    print((solve(*(open(0).read().splitlines()))))

# coding: utf-8
def solve(*args: str) -> str:
    n = int(args[0])
    LR = [tuple(map(int, a.split())) for a in args[1:]]
    L, R = list(zip(*LR))
    ret = 0
    # lp, rq = max(L), min(R)
    lp, rq = 0, 1 + 10**9
    for l, r in LR:
        lp, rq = max(lp, l), min(rq, r)
    ret = max(0, 1 + rq - lp) + max(0, max(1 + r - l for l, r in LR))
    AB = [[max(0, 1 + r - lp), max(0, 1 + rq - l)] for l, r in LR]
    AB.sort(key=lambda x: (x[0], -x[1]))
    A, B = list(map(list, list(zip(*AB))))
    # for i in range(1, n):
    #     ret = max(ret, min(A[i:]) + min(B[:i]))
    b_min = 1 + 10**9
    for i in range(n - 1):
        b_min = min(b_min, B[i])
        ret = max(ret, b_min + A[i + 1])
    return str(ret)


if __name__ == "__main__":
    print((solve(*(open(0).read().splitlines()))))

-import numpy as np - - -    p, q = np.argmax(L), np.argmin(R) -    lp, rq = L[p], R[q] +    # lp, rq = max(L), min(R) +    lp, rq = 0, 1 + 10**9 +    for l, r in LR: +        lp, rq = max(lp, l), min(rq, r)