
# 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

import bisect



n = int(eval(input()))

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

l = int(eval(input()))

U = 17

dp = [[0]*n for _ in range(U+1)]

for i, x in enumerate(X):

  t = bisect.bisect_left(X, x+l)

  dp[0][i] = bisect.bisect_right(X, x+l) - 1

for k in range(U):

  for i in range(n):

    dp[k+1][i] = dp[k][dp[k][i]]

def test(x, a, b):

  for i in range(U, -1, -1):

    if x >> i & 1:

      a = dp[i][a]

  return a >= b

def solve(a, b):

  if a > b:

    a, b = b, a

  ng = 0

  ok = n-1

  while ok - ng > 1:

    mid = (ng + ok) // 2

    if test(mid, a, b):

      ok = mid

    else:

      ng = mid

  print(ok)

q = int(eval(input()))

for _ in range(q):

  a, b = list(map(int, input().split()))

  a -= 1

  b -= 1

  solve(a, b)

# optimized version of the same code:

import sys

input = sys.stdin.readline

import bisect



n = int(eval(input()))

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

l = int(eval(input()))

U = 17

dp = [[0]*n for _ in range(U+1)]

for i, x in enumerate(X):

  t = bisect.bisect_left(X, x+l)

  dp[0][i] = bisect.bisect_right(X, x+l) - 1

for k in range(U):

  for i in range(n):

    dp[k+1][i] = dp[k][dp[k][i]]

q = int(eval(input()))

for _ in range(q):

  a, b = list(map(int, input().split()))

  a -= 1

  b -= 1

  if a > b:

    a, b = b, a

  res = 1

  for k in range(U, -1, -1):

    if dp[k][a] < b:

      a = dp[k][a]

      res += (1<<k)

    if a == b:

      break

  print(res)
import sys

input = sys.stdin.readline
import bisect

n = int(eval(input()))
X = list(map(int, input().split()))
l = int(eval(input()))
U = 17
dp = [[0] * n for _ in range(U + 1)]
for i, x in enumerate(X):
    t = bisect.bisect_left(X, x + l)
    dp[0][i] = bisect.bisect_right(X, x + l) - 1
for k in range(U):
    for i in range(n):
        dp[k + 1][i] = dp[k][dp[k][i]]


def test(x, a, b):
    for i in range(U, -1, -1):
        if x >> i & 1:
            a = dp[i][a]
    return a >= b


def solve(a, b):
    if a > b:
        a, b = b, a
    ng = 0
    ok = n - 1
    while ok - ng > 1:
        mid = (ng + ok) // 2
        if test(mid, a, b):
            ok = mid
        else:
            ng = mid
    print(ok)


q = int(eval(input()))
for _ in range(q):
    a, b = list(map(int, input().split()))
    a -= 1
    b -= 1
    solve(a, b)

import sys

input = sys.stdin.readline
import bisect

n = int(eval(input()))
X = list(map(int, input().split()))
l = int(eval(input()))
U = 17
dp = [[0] * n for _ in range(U + 1)]
for i, x in enumerate(X):
    t = bisect.bisect_left(X, x + l)
    dp[0][i] = bisect.bisect_right(X, x + l) - 1
for k in range(U):
    for i in range(n):
        dp[k + 1][i] = dp[k][dp[k][i]]
q = int(eval(input()))
for _ in range(q):
    a, b = list(map(int, input().split()))
    a -= 1
    b -= 1
    if a > b:
        a, b = b, a
    res = 1
    for k in range(U, -1, -1):
        if dp[k][a] < b:
            a = dp[k][a]
            res += 1 << k
        if a == b:
            break
    print(res)

- - -def test(x, a, b): -    for i in range(U, -1, -1): -        if x >> i & 1: -            a = dp[i][a] -    return a >= b - - -def solve(a, b): -    if a > b: -        a, b = b, a -    ng = 0 -    ok = n - 1 -    while ok - ng > 1: -        mid = (ng + ok) // 2 -        if test(mid, a, b): -            ok = mid -        else: -            ng = mid -    print(ok) - - -    solve(a, b) +    if a > b: +        a, b = b, a +    res = 1 +    for k in range(U, -1, -1): +        if dp[k][a] < b: +            a = dp[k][a] +            res += 1 << k +        if a == b: +            break +    print(res)