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

from math import floor, sqrt

from collections import defaultdict

def factors(n):

    d = defaultdict(int)

    for i in range(2,floor(sqrt(n))+1):

        while n % i == 0:

            n //= i

            d[i] += 1

        if n == 1:

            break

    if n != 1:

        d[n] += 1

    return d

def inv(x, mod):

    k = mod - 2

    ret = 1

    while k > 0:

        if k&1:

            ret = (ret*x) % mod

        x = (x*x) % mod

        k >>= 1

    return ret

N, M = list(map(int,input().split()))

mod = 10**9+7

dic = factors(M)

K = len(dic)

SIZE = N+max(dic.values()) if list(dic.values()) else N

fact = [None]*(SIZE+1)

finv = [None]*(SIZE+1)

fact[0] = 1

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

    fact[i] = (fact[i-1]*i) % mod

finv[SIZE] = inv(fact[SIZE], mod=mod)

for i in range(SIZE, 0, -1):

    finv[i-1] = (finv[i]*i) % mod

def comb(n,k):

    tmp = (finv[k]*finv[n-k]) % mod

    return (fact[n]*tmp) % mod

ans = 1

for p in dic:

    ans = (ans*comb(dic[p]+N-1, dic[p])) % mod

print(ans)

# optimized version of the same code:

from math import floor, sqrt

from collections import defaultdict

N,M = list(map(int,input().split()))

d = defaultdict(int)

for i in range(2, floor(sqrt(M))+1):

    while M % i == 0:

        d[i] += 1

        M //= i

if M != 1:

    d[M] += 1

def comb(n,k):

    if k == 0:

        return 1

    return comb(n-1,k-1) * n // k

ans = 1

for e in list(d.values()):

    ans *= comb(N+e-1, e)

print((ans % (10**9+7)))
from math import floor, sqrt
from collections import defaultdict


def factors(n):
    d = defaultdict(int)
    for i in range(2, floor(sqrt(n)) + 1):
        while n % i == 0:
            n //= i
            d[i] += 1
        if n == 1:
            break
    if n != 1:
        d[n] += 1
    return d


def inv(x, mod):
    k = mod - 2
    ret = 1
    while k > 0:
        if k & 1:
            ret = (ret * x) % mod
        x = (x * x) % mod
        k >>= 1
    return ret


N, M = list(map(int, input().split()))
mod = 10**9 + 7
dic = factors(M)
K = len(dic)
SIZE = N + max(dic.values()) if list(dic.values()) else N
fact = [None] * (SIZE + 1)
finv = [None] * (SIZE + 1)
fact[0] = 1
for i in range(1, SIZE + 1):
    fact[i] = (fact[i - 1] * i) % mod
finv[SIZE] = inv(fact[SIZE], mod=mod)
for i in range(SIZE, 0, -1):
    finv[i - 1] = (finv[i] * i) % mod


def comb(n, k):
    tmp = (finv[k] * finv[n - k]) % mod
    return (fact[n] * tmp) % mod


ans = 1
for p in dic:
    ans = (ans * comb(dic[p] + N - 1, dic[p])) % mod
print(ans)

from math import floor, sqrt
from collections import defaultdict

N, M = list(map(int, input().split()))
d = defaultdict(int)
for i in range(2, floor(sqrt(M)) + 1):
    while M % i == 0:
        d[i] += 1
        M //= i
if M != 1:
    d[M] += 1


def comb(n, k):
    if k == 0:
        return 1
    return comb(n - 1, k - 1) * n // k


ans = 1
for e in list(d.values()):
    ans *= comb(N + e - 1, e)
print((ans % (10**9 + 7)))

- -def factors(n): -    d = defaultdict(int) -    for i in range(2, floor(sqrt(n)) + 1): -        while n % i == 0: -            n //= i -            d[i] += 1 -        if n == 1: -            break -    if n != 1: -        d[n] += 1 -    return d - - -def inv(x, mod): -    k = mod - 2 -    ret = 1 -    while k > 0: -        if k & 1: -            ret = (ret * x) % mod -        x = (x * x) % mod -        k >>= 1 -    return ret - - -mod = 10**9 + 7 -dic = factors(M) -K = len(dic) -SIZE = N + max(dic.values()) if list(dic.values()) else N -fact = [None] * (SIZE + 1) -finv = [None] * (SIZE + 1) -fact[0] = 1 -for i in range(1, SIZE + 1): -    fact[i] = (fact[i - 1] * i) % mod -finv[SIZE] = inv(fact[SIZE], mod=mod) -for i in range(SIZE, 0, -1): -    finv[i - 1] = (finv[i] * i) % mod +d = defaultdict(int) +for i in range(2, floor(sqrt(M)) + 1): +    while M % i == 0: +        d[i] += 1 +        M //= i +if M != 1: +    d[M] += 1 -    tmp = (finv[k] * finv[n - k]) % mod -    return (fact[n] * tmp) % mod +    if k == 0: +        return 1 +    return comb(n - 1, k - 1) * n // k -for p in dic: -    ans = (ans * comb(dic[p] + N - 1, dic[p])) % mod -print(ans) +for e in list(d.values()): +    ans *= comb(N + e - 1, e) +print((ans % (10**9 + 7)))