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

input = sys.stdin.readline



def main():

  n, m = map(int, input().split())

  LR = [list(map(int, input().split())) for _ in range(n)]

  

  BIT = [0]*(m+2)

  def add(i, a):

    while i <= m+1:

      BIT[i] += a

      i += i&(-i)

  def bit_sum(i):

    res = 0

    while i > 0:

      res += BIT[i]

      i -= i&(-i)

    return res

  

  S = sorted([(r-l+1, l, r) for l, r in LR], reverse=True)

  cnt = n

  L = []

  for i in range(1, m+1):

    while S and S[-1][0] == i:

      c, l, r = S.pop()

      cnt -= 1

      add(l, 1)

      add(r+1, -1)

    res = cnt

    for j in range(0, m+1, i):

      res += bit_sum(j)

    L.append(res)

  print(*L, sep="\n")



if __name__ == "__main__":

  main()


# optimized version of the same code:

import sys

input = sys.stdin.readline



def main():

  n, m = list(map(int, input().split()))

  S = [[] for _ in range(m+1)]

  for _ in range(n):

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

    S[r-l+1].append((l, r))

  

  BIT = [0]*(m+2)

  def add(i, a):

    while i <= m+1:

      BIT[i] += a

      i += i&(-i)

  def bit_sum(i):

    res = 0

    while i > 0:

      res += BIT[i]

      i -= i&(-i)

    return res

  cnt = n

  for i in range(1, m+1):

    for l, r in S[i]:

      cnt -= 1

      add(l, 1)

      add(r+1, -1)

    res = cnt

    for j in range(0, m+1, i):

      res += bit_sum(j)

    print(res)



if __name__ == "__main__":

  main()
import sys

input = sys.stdin.readline


def main():
    n, m = map(int, input().split())
    LR = [list(map(int, input().split())) for _ in range(n)]
    BIT = [0] * (m + 2)

    def add(i, a):
        while i <= m + 1:
            BIT[i] += a
            i += i & (-i)

    def bit_sum(i):
        res = 0
        while i > 0:
            res += BIT[i]
            i -= i & (-i)
        return res

    S = sorted([(r - l + 1, l, r) for l, r in LR], reverse=True)
    cnt = n
    L = []
    for i in range(1, m + 1):
        while S and S[-1][0] == i:
            c, l, r = S.pop()
            cnt -= 1
            add(l, 1)
            add(r + 1, -1)
        res = cnt
        for j in range(0, m + 1, i):
            res += bit_sum(j)
        L.append(res)
    print(*L, sep="\n")


if __name__ == "__main__":
    main()

import sys

input = sys.stdin.readline


def main():
    n, m = list(map(int, input().split()))
    S = [[] for _ in range(m + 1)]
    for _ in range(n):
        l, r = list(map(int, input().split()))
        S[r - l + 1].append((l, r))
    BIT = [0] * (m + 2)

    def add(i, a):
        while i <= m + 1:
            BIT[i] += a
            i += i & (-i)

    def bit_sum(i):
        res = 0
        while i > 0:
            res += BIT[i]
            i -= i & (-i)
        return res

    cnt = n
    for i in range(1, m + 1):
        for l, r in S[i]:
            cnt -= 1
            add(l, 1)
            add(r + 1, -1)
        res = cnt
        for j in range(0, m + 1, i):
            res += bit_sum(j)
        print(res)


if __name__ == "__main__":
    main()

-    n, m = map(int, input().split()) -    LR = [list(map(int, input().split())) for _ in range(n)] +    n, m = list(map(int, input().split())) +    S = [[] for _ in range(m + 1)] +    for _ in range(n): +        l, r = list(map(int, input().split())) +        S[r - l + 1].append((l, r)) -    S = sorted([(r - l + 1, l, r) for l, r in LR], reverse=True) -    L = [] -        while S and S[-1][0] == i: -            c, l, r = S.pop() +        for l, r in S[i]: -        L.append(res) -    print(*L, sep="\n") +        print(res)