
# 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, k = list(map(int, input().split()))

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

mod = 10 ** 9 + 7



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

dp[0][0] = 1

for i in range(n):

    dp[i + 1][0] = dp[i][0]

    for j in range(1, k+1):

        dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i][j]) % mod

    for j in range(k, a[i], -1):

        dp[i + 1][j] = (dp[i + 1][j] - dp[i + 1][j - a[i] - 1]) % mod

print((dp[n][-1]))

# optimized version of the same code:

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

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

mod = 10 ** 9 + 7



f = [0] * (k + 1)

f[0] = 1

for i in range(n):

    for j in range(1, k+1):

        f[j] = (f[j] + f[j - 1]) % mod # 1/(1-x):累積和

    for j in range(k, a[i], -1): # 1-x^(a[i]+1) a[i]+1次したの項を引く

        f[j] = (f[j] - f[j - a[i] - 1]) % mod

print((f[-1]))
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10**9 + 7
dp = [[0] * (k + 1) for _ in range(n + 1)]
dp[0][0] = 1
for i in range(n):
    dp[i + 1][0] = dp[i][0]
    for j in range(1, k + 1):
        dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i][j]) % mod
    for j in range(k, a[i], -1):
        dp[i + 1][j] = (dp[i + 1][j] - dp[i + 1][j - a[i] - 1]) % mod
print((dp[n][-1]))

n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10**9 + 7
f = [0] * (k + 1)
f[0] = 1
for i in range(n):
    for j in range(1, k + 1):
        f[j] = (f[j] + f[j - 1]) % mod  # 1/(1-x):累積和
    for j in range(k, a[i], -1):  # 1-x^(a[i]+1) a[i]+1次したの項を引く
        f[j] = (f[j] - f[j - a[i] - 1]) % mod
print((f[-1]))

-dp = [[0] * (k + 1) for _ in range(n + 1)] -dp[0][0] = 1 +f = [0] * (k + 1) +f[0] = 1 -    dp[i + 1][0] = dp[i][0] -        dp[i + 1][j] = (dp[i + 1][j - 1] + dp[i][j]) % mod -    for j in range(k, a[i], -1): -        dp[i + 1][j] = (dp[i + 1][j] - dp[i + 1][j - a[i] - 1]) % mod -print((dp[n][-1])) +        f[j] = (f[j] + f[j - 1]) % mod  # 1/(1-x):累積和 +    for j in range(k, a[i], -1):  # 1-x^(a[i]+1) a[i]+1次したの項を引く +        f[j] = (f[j] - f[j - a[i] - 1]) % mod +print((f[-1]))