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

n = int(eval(input()))



abc = [[] for i in range(n+1)]



for i in range(n-1):

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

    abc[a].append([b,c])

    abc[b].append([a,c])



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

xy = [[int(i) for i in input().split()] for j in range(Q)]



q = queue.Queue()



q.put(k)



path = [-1]*(n+1)

path[k] = 0



while not q.empty():

    tmp = q.get()

    for i in range(len(abc[tmp])):

        #print(abc[tmp])

        #exit()

        num = abc[tmp][i][0]

        if path[num] != -1:

            continue

        else:

            path[num] = path[tmp] + abc[tmp][i][1]

            q.put(num)

            

for i in range(Q):

    print((path[xy[i][0]]+path[xy[i][1]]))

# optimized version of the same code:

import queue

import sys

sys.setrecursionlimit(10**7)

n = int(eval(input()))



abc = [[] for i in range(n+1)]



for i in range(n-1):

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

    abc[a].append([b,c])

    abc[b].append([a,c])



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

xy = [[int(i) for i in input().split()] for j in range(Q)]



q = queue.Queue()



q.put(k)



path = [-1]*(n+1)

path[k] = 0



def dfs(p):

    for i in range(len(abc[p])):

        num = abc[p][i][0]

        if path[num] != -1:

            continue

        else:

            path[num] = path[p] + abc[p][i][1]

            dfs(num)



dfs(k)



for i in range(Q):

    print((path[xy[i][0]]+path[xy[i][1]]))
import queue

n = int(eval(input()))
abc = [[] for i in range(n + 1)]
for i in range(n - 1):
    a, b, c = list(map(int, input().split()))
    abc[a].append([b, c])
    abc[b].append([a, c])
Q, k = list(map(int, input().split()))
xy = [[int(i) for i in input().split()] for j in range(Q)]
q = queue.Queue()
q.put(k)
path = [-1] * (n + 1)
path[k] = 0
while not q.empty():
    tmp = q.get()
    for i in range(len(abc[tmp])):
        # print(abc[tmp])
        # exit()
        num = abc[tmp][i][0]
        if path[num] != -1:
            continue
        else:
            path[num] = path[tmp] + abc[tmp][i][1]
            q.put(num)
for i in range(Q):
    print((path[xy[i][0]] + path[xy[i][1]]))

import queue
import sys

sys.setrecursionlimit(10**7)
n = int(eval(input()))
abc = [[] for i in range(n + 1)]
for i in range(n - 1):
    a, b, c = list(map(int, input().split()))
    abc[a].append([b, c])
    abc[b].append([a, c])
Q, k = list(map(int, input().split()))
xy = [[int(i) for i in input().split()] for j in range(Q)]
q = queue.Queue()
q.put(k)
path = [-1] * (n + 1)
path[k] = 0


def dfs(p):
    for i in range(len(abc[p])):
        num = abc[p][i][0]
        if path[num] != -1:
            continue
        else:
            path[num] = path[p] + abc[p][i][1]
            dfs(num)


dfs(k)
for i in range(Q):
    print((path[xy[i][0]] + path[xy[i][1]]))

+import sys +sys.setrecursionlimit(10**7) -while not q.empty(): -    tmp = q.get() -    for i in range(len(abc[tmp])): -        # print(abc[tmp]) -        # exit() -        num = abc[tmp][i][0] + + +def dfs(p): +    for i in range(len(abc[p])): +        num = abc[p][i][0] -            path[num] = path[tmp] + abc[tmp][i][1] -            q.put(num) +            path[num] = path[p] + abc[p][i][1] +            dfs(num) + + +dfs(k)