
# 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 fractions import gcd

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

A = list([int(x) for x in input().split()])



cnt = [0 for _ in range(N)]

for i in range(N):

  a = A[i]

  while a%2 == 0:

    a = a // 2

    cnt[i] += 1



if max(cnt) > min(cnt):

  print((0))

  exit(0)

C = max(cnt)



A = list([x // pow(2,C) for x in A])

def gcd(a,b):

  if a<b:

    a,b = b,a

  while a%b > 0:

    a,b = b,a%b

  return b



def lcm(a,b):

  return a*b//gcd(a,b)



x = A[0]

for a in A[1:]:

  x = lcm(x,a)

x = x * pow(2,C-1)



print(((M // x + 1) // 2))

# optimized version of the same code:

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

A = list([int(x) for x in input().split()])



cnt = [0 for _ in range(N)]

for i in range(N):

  a = A[i]

  while a%2 == 0:

    a = a // 2

    cnt[i] += 1



if max(cnt) > min(cnt):

  print((0))

  exit(0)

C = max(cnt)



A = list([x // pow(2,C) for x in A])

def gcd(a,b):

  if a<b:

    a,b = b,a

  while a%b > 0:

    a,b = b,a%b

  return b



def lcm(a,b):

  return a*b//gcd(a,b)



x = A[0]

for a in A[1:]:

  x = lcm(x,a)

x = x * pow(2,C-1)



print(((M // x + 1) // 2))
from fractions import gcd

N, M = list(map(int, input().split()))
A = list([int(x) for x in input().split()])
cnt = [0 for _ in range(N)]
for i in range(N):
    a = A[i]
    while a % 2 == 0:
        a = a // 2
        cnt[i] += 1
if max(cnt) > min(cnt):
    print((0))
    exit(0)
C = max(cnt)
A = list([x // pow(2, C) for x in A])


def gcd(a, b):
    if a < b:
        a, b = b, a
    while a % b > 0:
        a, b = b, a % b
    return b


def lcm(a, b):
    return a * b // gcd(a, b)


x = A[0]
for a in A[1:]:
    x = lcm(x, a)
x = x * pow(2, C - 1)
print(((M // x + 1) // 2))

N, M = list(map(int, input().split()))
A = list([int(x) for x in input().split()])
cnt = [0 for _ in range(N)]
for i in range(N):
    a = A[i]
    while a % 2 == 0:
        a = a // 2
        cnt[i] += 1
if max(cnt) > min(cnt):
    print((0))
    exit(0)
C = max(cnt)
A = list([x // pow(2, C) for x in A])


def gcd(a, b):
    if a < b:
        a, b = b, a
    while a % b > 0:
        a, b = b, a % b
    return b


def lcm(a, b):
    return a * b // gcd(a, b)


x = A[0]
for a in A[1:]:
    x = lcm(x, a)
x = x * pow(2, C - 1)
print(((M // x + 1) // 2))

-from fractions import gcd -