
# 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 collections import defaultdict

while 1:

    n = int(input())

    if n == 0: break

    L = [0]*n

    D = [0]*n

    for man in range(n):

        m,l = list(map(int,input().split()))

        L[man] = l

        t = 0

        for date in range(m):

            s,e = list(map(int,input().split()))

            for s in range(s-6,e-6):

                t |= 1 << s

        D[man] = t



    dp = [defaultdict(int) for i in range(n)]

    dp[0][D[0]] = L[0]

    for i in range(1,n):

        for bit in list(dp[i-1].keys()):

            if bit&D[i] == 0:

                dp[i][bit|D[i]] = max(dp[i][bit|D[i]], dp[i-1][bit]+L[i])

            dp[i][bit] = max(dp[i][bit],dp[i-1][bit])

        dp[i][D[i]] = max(dp[i][D[i]], L[i])

        

    ans = max(max(dp[i].values()) for i in range(n))

    print(ans)

# optimized version of the same code:

from collections import defaultdict

while 1:

    n = int(input())

    if n == 0: break

    L = [0]*n

    T = [0]*n

    for man in range(n):

        m,l = list(map(int,input().split()))

        L[man] = l

        t = 0

        for date in range(m):

            s,e = list(map(int,input().split()))

            t |= 2**(e-6)-2**(s-6)

        T[man] = t



    dp = defaultdict(int)

    dp[T[0]] = L[0]

    for i in range(1,n):

        for bit in list(dp.keys()):

            if bit&T[i] == 0:

                dp[bit|T[i]] = max(dp[bit|T[i]], dp[bit]+L[i])

        dp[T[i]] = max(dp[T[i]], L[i])

        

    print(max(dp.values()))
from collections import defaultdict

while 1:
    n = int(input())
    if n == 0:
        break
    L = [0] * n
    D = [0] * n
    for man in range(n):
        m, l = list(map(int, input().split()))
        L[man] = l
        t = 0
        for date in range(m):
            s, e = list(map(int, input().split()))
            for s in range(s - 6, e - 6):
                t |= 1 << s
        D[man] = t
    dp = [defaultdict(int) for i in range(n)]
    dp[0][D[0]] = L[0]
    for i in range(1, n):
        for bit in list(dp[i - 1].keys()):
            if bit & D[i] == 0:
                dp[i][bit | D[i]] = max(dp[i][bit | D[i]], dp[i - 1][bit] + L[i])
            dp[i][bit] = max(dp[i][bit], dp[i - 1][bit])
        dp[i][D[i]] = max(dp[i][D[i]], L[i])
    ans = max(max(dp[i].values()) for i in range(n))
    print(ans)

from collections import defaultdict

while 1:
    n = int(input())
    if n == 0:
        break
    L = [0] * n
    T = [0] * n
    for man in range(n):
        m, l = list(map(int, input().split()))
        L[man] = l
        t = 0
        for date in range(m):
            s, e = list(map(int, input().split()))
            t |= 2 ** (e - 6) - 2 ** (s - 6)
        T[man] = t
    dp = defaultdict(int)
    dp[T[0]] = L[0]
    for i in range(1, n):
        for bit in list(dp.keys()):
            if bit & T[i] == 0:
                dp[bit | T[i]] = max(dp[bit | T[i]], dp[bit] + L[i])
        dp[T[i]] = max(dp[T[i]], L[i])
    print(max(dp.values()))

-    D = [0] * n +    T = [0] * n -            for s in range(s - 6, e - 6): -                t |= 1 << s -        D[man] = t -    dp = [defaultdict(int) for i in range(n)] -    dp[0][D[0]] = L[0] +            t |= 2 ** (e - 6) - 2 ** (s - 6) +        T[man] = t +    dp = defaultdict(int) +    dp[T[0]] = L[0] -        for bit in list(dp[i - 1].keys()): -            if bit & D[i] == 0: -                dp[i][bit | D[i]] = max(dp[i][bit | D[i]], dp[i - 1][bit] + L[i]) -            dp[i][bit] = max(dp[i][bit], dp[i - 1][bit]) -        dp[i][D[i]] = max(dp[i][D[i]], L[i]) -    ans = max(max(dp[i].values()) for i in range(n)) -    print(ans) +        for bit in list(dp.keys()): +            if bit & T[i] == 0: +                dp[bit | T[i]] = max(dp[bit | T[i]], dp[bit] + L[i]) +        dp[T[i]] = max(dp[T[i]], L[i]) +    print(max(dp.values()))