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

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



con = 0

ans = list(int() for _ in range(100000))

pre = 0





for _ in range(K):



    D = int(eval(input()))

    arr = list(map(int,input().split()))



    for j in range(D):



        ans[pre+j]=arr[j]



    pre += D



        

fin = (N+1) - len(set(ans))



print(fin)

# optimized version of the same code:

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



con = 0

ans = list(int() for _ in range(10001))

pre = 0





for _ in range(K):



    D = int(eval(input()))

    arr = list(map(int,input().split()))



    for j in range(D):



        ans[pre+j]=arr[j]



    pre += D



        

fin = (N+1) - len(set(ans))



print(fin)
N, K = list(map(int, input().split()))
con = 0
ans = list(int() for _ in range(100000))
pre = 0
for _ in range(K):
    D = int(eval(input()))
    arr = list(map(int, input().split()))
    for j in range(D):
        ans[pre + j] = arr[j]
    pre += D
fin = (N + 1) - len(set(ans))
print(fin)

N, K = list(map(int, input().split()))
con = 0
ans = list(int() for _ in range(10001))
pre = 0
for _ in range(K):
    D = int(eval(input()))
    arr = list(map(int, input().split()))
    for j in range(D):
        ans[pre + j] = arr[j]
    pre += D
fin = (N + 1) - len(set(ans))
print(fin)

-ans = list(int() for _ in range(100000)) +ans = list(int() for _ in range(10001))