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

sys.setrecursionlimit(100000)

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

edges = [list(map(int, input().split())) for _ in range(M)]



graph = [[] for _ in range(N)]

for x, y in edges:

    graph[x - 1].append(y - 1)

    graph[y - 1].append(x - 1)



def dfs(v, c):

    # c: color = 1 or -1

    node[v] = c

    for i in graph[v]:

        if node[i] == c:

            return False

        

        if node[i] == 0 and not dfs(i, -c):

            return False

        

    return True



node = [0] * N

if dfs(0, 1):

    x = sum(v + 1 for v in node) // 2

    print((x * (N - x) - M))

else:

    print((N * (N - 1) // 2 - M))


# optimized version of the same code:

from collections import deque

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

edges = [list(map(int, input().split())) for _ in range(M)]



graph = [[] for _ in range(N)]

for x, y in edges:

    graph[x - 1].append(y - 1)

    graph[y - 1].append(x - 1)



def dfs(s, c):

    q = deque()

    q.append(s)

    visited[s] = True

    color[s] = c

    

    while len(q) > 0:

        v = q.pop()

        for i in graph[v]:

            if visited[i] and color[i] == color[v]:

                return False

            

            if not visited[i]:

                visited[i] = True

                color[i] = -color[v]

                q.append(i)

                

    return True



visited = [False] * N

color = [0] * N



if dfs(0, 1):

    x = sum(v + 1 for v in color) // 2

    print((x * (N - x) - M))

else:

    print((N * (N - 1) // 2 - M))

    

    
import sys

sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(M)]
graph = [[] for _ in range(N)]
for x, y in edges:
    graph[x - 1].append(y - 1)
    graph[y - 1].append(x - 1)


def dfs(v, c):
    # c: color = 1 or -1
    node[v] = c
    for i in graph[v]:
        if node[i] == c:
            return False
        if node[i] == 0 and not dfs(i, -c):
            return False
    return True


node = [0] * N
if dfs(0, 1):
    x = sum(v + 1 for v in node) // 2
    print((x * (N - x) - M))
else:
    print((N * (N - 1) // 2 - M))

from collections import deque

N, M = list(map(int, input().split()))
edges = [list(map(int, input().split())) for _ in range(M)]
graph = [[] for _ in range(N)]
for x, y in edges:
    graph[x - 1].append(y - 1)
    graph[y - 1].append(x - 1)


def dfs(s, c):
    q = deque()
    q.append(s)
    visited[s] = True
    color[s] = c
    while len(q) > 0:
        v = q.pop()
        for i in graph[v]:
            if visited[i] and color[i] == color[v]:
                return False
            if not visited[i]:
                visited[i] = True
                color[i] = -color[v]
                q.append(i)
    return True


visited = [False] * N
color = [0] * N
if dfs(0, 1):
    x = sum(v + 1 for v in color) // 2
    print((x * (N - x) - M))
else:
    print((N * (N - 1) // 2 - M))

-import sys +from collections import deque -sys.setrecursionlimit(100000) -def dfs(v, c): -    # c: color = 1 or -1 -    node[v] = c -    for i in graph[v]: -        if node[i] == c: -            return False -        if node[i] == 0 and not dfs(i, -c): -            return False +def dfs(s, c): +    q = deque() +    q.append(s) +    visited[s] = True +    color[s] = c +    while len(q) > 0: +        v = q.pop() +        for i in graph[v]: +            if visited[i] and color[i] == color[v]: +                return False +            if not visited[i]: +                visited[i] = True +                color[i] = -color[v] +                q.append(i) -node = [0] * N +visited = [False] * N +color = [0] * N -    x = sum(v + 1 for v in node) // 2 +    x = sum(v + 1 for v in color) // 2