
# 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,u,v=list(map(int,input().split()))

anss=0

u-=1

v-=1

d=[[]for _ in range(n)]

inf=float('inf')

aoki=[inf]*n

for i in range(n-1):

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

  a-=1

  b-=1

  d[a].append(b)

  d[b].append(a)

Q=d[v]

aoki[v]=0

dis=1

visited={v}

while Q:

  P=[]

  for i in Q:

    visited.add(i)

    for j in d[i]:

      if j not in visited:P.append(j)

    aoki[i]=dis

  dis+=1

  Q=P

Q=d[u]

chokudai=[-1]*n

chokudai[u]=0

dis=1

visited={u}

point=-1

while Q:

  P=[]

  for i in Q:

    visited.add(i)

    for j in d[i]:

      if aoki[j]<=dis+1:

        if aoki[j]==dis+1:anss=1

        if point<0:point=i

        continue

      if j not in visited:P.append(j)

    chokudai[i]=dis

  dis+=1

  Q=P

Q=d[point]

dis=chokudai[point]+1

visited={point}

while Q:

  P=[]

  for i in Q:

    visited.add(i)

    if chokudai[i]==-1:continue

    chokudai[i]=max(dis,chokudai[i])

    for j in d[i]:

      if j not in visited:P.append(j)

  dis+=1

  Q=P

ans=0

for i in range(n):

  if aoki[i]>chokudai[i]:ans=max(ans,chokudai[i])

print((ans+anss))

#print(aoki)

#print(chokudai)

# optimized version of the same code:

n,u,v=list(map(int,input().split()))

u-=1

v-=1

e=[[]for _ in range(n)]

for i in range(n-1):

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

  a-=1

  b-=1

  e[a].append(b)

  e[b].append(a)

cho=[u]

cho_dis=[10**7]*n

cho_dis[u]=0

cho_visited={u}

countt=1

while cho:

  CHO=[]

  for i in cho:

    for j in e[i]:

      if j in cho_visited:continue

      cho_visited.add(j)

      CHO.append(j)

      cho_dis[j]=countt

  countt+=1

  cho=CHO

aok=[v]

aok_dis=[10**7]*n

aok_dis[v]=0

aok_visited={v}

countt=1

while aok:

  AOK=[]

  for i in aok:

    for j in e[i]:

      if j in aok_visited:continue

      aok_visited.add(j)

      AOK.append(j)

      aok_dis[j]=countt

  countt+=1

  aok=AOK

ans=0

for i in range(n):

  if cho_dis[i]<aok_dis[i]:ans=max(ans,aok_dis[i]-1)

print(ans)
n, u, v = list(map(int, input().split()))
anss = 0
u -= 1
v -= 1
d = [[] for _ in range(n)]
inf = float("inf")
aoki = [inf] * n
for i in range(n - 1):
    a, b = list(map(int, input().split()))
    a -= 1
    b -= 1
    d[a].append(b)
    d[b].append(a)
Q = d[v]
aoki[v] = 0
dis = 1
visited = {v}
while Q:
    P = []
    for i in Q:
        visited.add(i)
        for j in d[i]:
            if j not in visited:
                P.append(j)
        aoki[i] = dis
    dis += 1
    Q = P
Q = d[u]
chokudai = [-1] * n
chokudai[u] = 0
dis = 1
visited = {u}
point = -1
while Q:
    P = []
    for i in Q:
        visited.add(i)
        for j in d[i]:
            if aoki[j] <= dis + 1:
                if aoki[j] == dis + 1:
                    anss = 1
                if point < 0:
                    point = i
                continue
            if j not in visited:
                P.append(j)
        chokudai[i] = dis
    dis += 1
    Q = P
Q = d[point]
dis = chokudai[point] + 1
visited = {point}
while Q:
    P = []
    for i in Q:
        visited.add(i)
        if chokudai[i] == -1:
            continue
        chokudai[i] = max(dis, chokudai[i])
        for j in d[i]:
            if j not in visited:
                P.append(j)
    dis += 1
    Q = P
ans = 0
for i in range(n):
    if aoki[i] > chokudai[i]:
        ans = max(ans, chokudai[i])
print((ans + anss))
# print(aoki)
# print(chokudai)

n, u, v = list(map(int, input().split()))
u -= 1
v -= 1
e = [[] for _ in range(n)]
for i in range(n - 1):
    a, b = list(map(int, input().split()))
    a -= 1
    b -= 1
    e[a].append(b)
    e[b].append(a)
cho = [u]
cho_dis = [10**7] * n
cho_dis[u] = 0
cho_visited = {u}
countt = 1
while cho:
    CHO = []
    for i in cho:
        for j in e[i]:
            if j in cho_visited:
                continue
            cho_visited.add(j)
            CHO.append(j)
            cho_dis[j] = countt
    countt += 1
    cho = CHO
aok = [v]
aok_dis = [10**7] * n
aok_dis[v] = 0
aok_visited = {v}
countt = 1
while aok:
    AOK = []
    for i in aok:
        for j in e[i]:
            if j in aok_visited:
                continue
            aok_visited.add(j)
            AOK.append(j)
            aok_dis[j] = countt
    countt += 1
    aok = AOK
ans = 0
for i in range(n):
    if cho_dis[i] < aok_dis[i]:
        ans = max(ans, aok_dis[i] - 1)
print(ans)

-anss = 0 -d = [[] for _ in range(n)] -inf = float("inf") -aoki = [inf] * n +e = [[] for _ in range(n)] -    d[a].append(b) -    d[b].append(a) -Q = d[v] -aoki[v] = 0 -dis = 1 -visited = {v} -while Q: -    P = [] -    for i in Q: -        visited.add(i) -        for j in d[i]: -            if j not in visited: -                P.append(j) -        aoki[i] = dis -    dis += 1 -    Q = P -Q = d[u] -chokudai = [-1] * n -chokudai[u] = 0 -dis = 1 -visited = {u} -point = -1 -while Q: -    P = [] -    for i in Q: -        visited.add(i) -        for j in d[i]: -            if aoki[j] <= dis + 1: -                if aoki[j] == dis + 1: -                    anss = 1 -                if point < 0: -                    point = i +    e[a].append(b) +    e[b].append(a) +cho = [u] +cho_dis = [10**7] * n +cho_dis[u] = 0 +cho_visited = {u} +countt = 1 +while cho: +    CHO = [] +    for i in cho: +        for j in e[i]: +            if j in cho_visited: -            if j not in visited: -                P.append(j) -        chokudai[i] = dis -    dis += 1 -    Q = P -Q = d[point] -dis = chokudai[point] + 1 -visited = {point} -while Q: -    P = [] -    for i in Q: -        visited.add(i) -        if chokudai[i] == -1: -            continue -        chokudai[i] = max(dis, chokudai[i]) -        for j in d[i]: -            if j not in visited: -                P.append(j) -    dis += 1 -    Q = P +            cho_visited.add(j) +            CHO.append(j) +            cho_dis[j] = countt +    countt += 1 +    cho = CHO +aok = [v] +aok_dis = [10**7] * n +aok_dis[v] = 0 +aok_visited = {v} +countt = 1 +while aok: +    AOK = [] +    for i in aok: +        for j in e[i]: +            if j in aok_visited: +                continue +            aok_visited.add(j) +            AOK.append(j) +            aok_dis[j] = countt +    countt += 1 +    aok = AOK -    if aoki[i] > chokudai[i]: -        ans = max(ans, chokudai[i]) -print((ans + anss)) -# print(aoki) -# print(chokudai) +    if cho_dis[i] < aok_dis[i]: +        ans = max(ans, aok_dis[i] - 1) +print(ans)