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



mod = 1000000007

def pow(x, n):

    ret = 1

    while n > 0:

        if (n & 1) == 1:

            ret = (ret * x) % mod

        x = (x * x) % mod

        n >>= 1

    return ret



fac = [1]

inv = [1]

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

    fac.append((fac[-1] * i) % mod)

    inv.append(pow(fac[i], mod - 2))



def cmb(n, k):

    return (fac[n] * inv[k] * inv[n - k]) % mod



def doit(n, m, k):

    ret = 0

    for d in range(m):

        ret = (ret + d * (m - d)) % mod

    return (ret * n * n * cmb(n * m - 2, k - 2)) % mod



print(((doit(n, m, k) + doit(m, n, k)) % mod))

# optimized version of the same code:

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



mod = 1000000007

fac = [1]

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

    fac.append((fac[-1] * i) % mod)



def pow(x, n):

    ret = 1

    while n > 0:

        if (n & 1) == 1:

            ret = (ret * x) % mod

        x = (x * x) % mod

        n >>= 1

    return ret



def inv(i):

    return pow(fac[i], mod - 2)



def cmb(n, k):

    return (fac[n] * inv(k) * inv(n - k)) % mod



x = sum(d * (m - d) for d in range(m)) % mod

y = sum(d * (n - d) for d in range(n)) % mod



c = cmb(n * m - 2, k - 2)

x = (x * n * n * c) % mod

y = (y * m * m * c) % mod



print(((x + y) % mod))
n, m, k = list(map(int, input().split()))
mod = 1000000007


def pow(x, n):
    ret = 1
    while n > 0:
        if (n & 1) == 1:
            ret = (ret * x) % mod
        x = (x * x) % mod
        n >>= 1
    return ret


fac = [1]
inv = [1]
for i in range(1, n * m + 1):
    fac.append((fac[-1] * i) % mod)
    inv.append(pow(fac[i], mod - 2))


def cmb(n, k):
    return (fac[n] * inv[k] * inv[n - k]) % mod


def doit(n, m, k):
    ret = 0
    for d in range(m):
        ret = (ret + d * (m - d)) % mod
    return (ret * n * n * cmb(n * m - 2, k - 2)) % mod


print(((doit(n, m, k) + doit(m, n, k)) % mod))

n, m, k = list(map(int, input().split()))
mod = 1000000007
fac = [1]
for i in range(1, n * m + 1):
    fac.append((fac[-1] * i) % mod)


def pow(x, n):
    ret = 1
    while n > 0:
        if (n & 1) == 1:
            ret = (ret * x) % mod
        x = (x * x) % mod
        n >>= 1
    return ret


def inv(i):
    return pow(fac[i], mod - 2)


def cmb(n, k):
    return (fac[n] * inv(k) * inv(n - k)) % mod


x = sum(d * (m - d) for d in range(m)) % mod
y = sum(d * (n - d) for d in range(n)) % mod
c = cmb(n * m - 2, k - 2)
x = (x * n * n * c) % mod
y = (y * m * m * c) % mod
print(((x + y) % mod))

+fac = [1] +for i in range(1, n * m + 1): +    fac.append((fac[-1] * i) % mod) -fac = [1] -inv = [1] -for i in range(1, n * m + 1): -    fac.append((fac[-1] * i) % mod) -    inv.append(pow(fac[i], mod - 2)) +def inv(i): +    return pow(fac[i], mod - 2) -    return (fac[n] * inv[k] * inv[n - k]) % mod +    return (fac[n] * inv(k) * inv(n - k)) % mod -def doit(n, m, k): -    ret = 0 -    for d in range(m): -        ret = (ret + d * (m - d)) % mod -    return (ret * n * n * cmb(n * m - 2, k - 2)) % mod - - -print(((doit(n, m, k) + doit(m, n, k)) % mod)) +x = sum(d * (m - d) for d in range(m)) % mod +y = sum(d * (n - d) for d in range(n)) % mod +c = cmb(n * m - 2, k - 2) +x = (x * n * n * c) % mod +y = (y * m * m * c) % mod +print(((x + y) % mod))