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

from scipy.sparse.csgraph import floyd_warshall



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

r = tuple(map(int, input().split()))



INF = 10**10



d = [[INF] * N for _ in range(N)]



for i in range(N):

    d[i][i] = 0



for _ in range(M):

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

    a -= 1

    b -= 1

    if d[a][b] > c:

        d[a][b] = c

        d[b][a] = c





def warshall(d):

    for k in range(N):

        for i in range(N):

            for j in range(N):

                if d[i][j] > d[i][k] + d[k][j]:

                    d[i][j] = d[i][k] + d[k][j]





# d = floyd_warshall(d)

warshall(d)





ans = INF

for p in itertools.permutations(r):

    dist = 0

    for i in range(R-1):

        dist += d[p[i]-1][p[i+1]-1]



    if ans > dist:

        ans = dist



print((int(ans)))

# optimized version of the same code:

import itertools



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

r = tuple(map(int, input().split()))



INF = 10**10



d = [[INF] * N for _ in range(N)]



for i in range(N):

    d[i][i] = 0



for _ in range(M):

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

    a -= 1

    b -= 1

    if d[a][b] > c:

        d[a][b] = c

        d[b][a] = c





def warshall(d):

    for k in range(N):

        for i in range(N):

            for j in range(N):

                if d[i][j] > d[i][k] + d[k][j]:

                    d[i][j] = d[i][k] + d[k][j]





# d = floyd_warshall(d)

warshall(d)





ans = INF

for p in itertools.permutations(r):

    dist = 0

    for i in range(R-1):

        dist += d[p[i]-1][p[i+1]-1]



    if ans > dist:

        ans = dist



print((int(ans)))

import itertools
from scipy.sparse.csgraph import floyd_warshall

N, M, R = list(map(int, input().split()))
r = tuple(map(int, input().split()))
INF = 10**10
d = [[INF] * N for _ in range(N)]
for i in range(N):
    d[i][i] = 0
for _ in range(M):
    a, b, c = list(map(int, input().split()))
    a -= 1
    b -= 1
    if d[a][b] > c:
        d[a][b] = c
        d[b][a] = c


def warshall(d):
    for k in range(N):
        for i in range(N):
            for j in range(N):
                if d[i][j] > d[i][k] + d[k][j]:
                    d[i][j] = d[i][k] + d[k][j]


# d = floyd_warshall(d)
warshall(d)
ans = INF
for p in itertools.permutations(r):
    dist = 0
    for i in range(R - 1):
        dist += d[p[i] - 1][p[i + 1] - 1]
    if ans > dist:
        ans = dist
print((int(ans)))

import itertools

N, M, R = list(map(int, input().split()))
r = tuple(map(int, input().split()))
INF = 10**10
d = [[INF] * N for _ in range(N)]
for i in range(N):
    d[i][i] = 0
for _ in range(M):
    a, b, c = list(map(int, input().split()))
    a -= 1
    b -= 1
    if d[a][b] > c:
        d[a][b] = c
        d[b][a] = c


def warshall(d):
    for k in range(N):
        for i in range(N):
            for j in range(N):
                if d[i][j] > d[i][k] + d[k][j]:
                    d[i][j] = d[i][k] + d[k][j]


# d = floyd_warshall(d)
warshall(d)
ans = INF
for p in itertools.permutations(r):
    dist = 0
    for i in range(R - 1):
        dist += d[p[i] - 1][p[i + 1] - 1]
    if ans > dist:
        ans = dist
print((int(ans)))

-from scipy.sparse.csgraph import floyd_warshall