Problem:
 Score : 200 points    Problem Statement You are given a string s consisting of lowercase English letters. Extract all the characters in the odd-indexed positions and print the string obtained by concatenating them. Here, the leftmost character is assigned the index 1 .      Constraints  Each character in s is a lowercase English letter.  1≤|s|≤10^5         Input The input is given from Standard Input in the following format:  s       Output Print the string obtained by concatenating all the characters in the odd-numbered positions.        Sample Input 1 atcoder      Sample Output 1 acdr  Extract the first character a , the third character c , the fifth character d and the seventh character r to obtain acdr .       Sample Input 2 aaaa      Sample Output 2 aa       Sample Input 3 z      Sample Output 3 z       Sample Input 4 fukuokayamaguchi      Sample Output 4 fkoaaauh

Solution (Python):
x = list(input())
n = len(x)
z = []
for i in range(n):
    if i%2 == 0:
        z.append(x[i]) 
print(''.join(z))

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s = input()
print(s[0::2])

Solution (Python):
s = input()
for i in range(0, len(s), 2):
  print(s[i], end='')
print()

Solution (Python):
print(input()[0::2])

Solution (Python):
print(input()[::2])

Solution (Python):
s = list(input())
print("".join([s[i] for i in range(len(s)) if i%2==0]))

Solution (Python):
s = input()
n = (len(s) + 1) // 2
for i in range(n):
    print(s[2 * i], end = "")
print()

Solution (Python):
def main(s):
    print(s[::2])


if __name__ == "__main__":
    s = input()

    main(s)

Solution (Python):
print(input()[0::2])

Solution (Python):
s = input()
print(s[0::2])

Solution (Python):
s = str(input())
n = len(s)
t = ''
for i in range(n):
    if i%2 == 0:
        t += s[i]
print(t)

Solution (Python):
print(input()[::2])

Solution (Python):
def main():
    print(input()[::2])


if __name__ == '__main__':
    main()

Solution (Python):
S = input()
print(''.join([S[i]for i in range(len(S)) if i%2==0]))

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
print(input()[0::2])

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()
print(s[0::2])

Solution (Python):
s = input()
for i in range(len(s)):
    if i % 2 == 0 :
        print(s[i],end="")

Solution (Python):
S=input()
ans=[]
for i in range (len(S)):
	if i%2==0:
		ans.append(S[i])
print("".join(ans))

Solution (Python):
s=input()
s_len=len(s)
ans=""
ans_len=(s_len+1)//2
for i in range(ans_len):
    ans+=s[2*i]
print(ans)

Solution (Python):
s = input()
t = ''
for i in range(len(s)):
    if i % 2 == 0:
        t = t + s[i]

print(t)

Solution (Python):
s = input()
count = 1
for a in s:
  if not count%2==0:
    print(a, end="")
  count = count + 1

Solution (Python):
s = list(input())

t = ""

for i in range(len(s)):
    if i % 2 == 0:
        t += s[i]
print(t)

Solution (Python):
s=input()
for i in range(0,len(s),2):
    print(s[i],end="")
print("")

Solution (Python):
S=input()
ls=list(S)
ls2=S[::2]
print(*ls2,sep="")

Solution (Python):

print(input()[::2])

Solution (Python):
s=str(input())
s=list(s)
for i in range(len(s)):
    if i%2==0:
        print(s[i],end="")

Solution (Python):
print(input()[::2])

Solution (Python):


s = input().strip()

for i in range(0,len(s),2):
    print(s[i],end="")

Solution (Python):
s = input()
print(s[0::2])

Solution (Python):


import sys


def solver(inputStr):
    answer = ''
    answerList = []
    for j in range(0, len(inputStr), 2):
        answerList.append(inputStr[j])
    answer = ''.join(answerList)
    return answer


if __name__ == "__main__":
    s = sys.stdin.readline().split()
    print(solver(s[0]))

Solution (Python):
s=input()
s=s[::2]
print(s)

Solution (Python):
s = input()
print(s[0::2])

Solution (Python):
s = input()

ans = ""

for i in range(0,len(s)) :
    if i%2 == 0 :
        ans += s[i]

print(ans)

Solution (Python):
s = input()
t = s[0::2]
print(t)

Solution (Python):
A = list(input())
N = len(A)
Ans = []
for i in range(0, N, 2):
    Ans.append(A[i])
print("".join(Ans))

Solution (Python):
s=list(input())
print("".join(s[0::2]))

Solution (Python):
import sys
input = sys.stdin.readline

def main():
    s = input()
    ans = ""
    for i in range(0, len(s), 2):
        ans += s[i]
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
s = input()

odd = s[0::2]

print(odd)

Solution (Python):
s = input()
a = ""

for i in range(len(s)):
  if i%2 == 0:
    a = a + s[i]
    
print(a)

Solution (Python):
s = input()
f = ''
for i in range(len(s)):
  if i % 2 == 0:
    f += s[i]
print(f)

Solution (Python):
def oddstring(s):

    ans = ""

    for i in range(0 , len(s) , 2):
        ans += s[i]

    return ans

def main():
    s = str(input())
    print(oddstring(s))

if __name__ == '__main__':
    main()

Solution (Python):
s=input()
S=s[0::2]
print(S)

Solution (Python):
s=input()
lis=[]
for i in range(len(s)):
  if i%2==0:
  	lis.append(s[i])
print(''.join(lis))

Solution (Python):
s = input()
ans = ""
for x in range(int((len(s) + 1) // 2)):
    ans += s[2 * x]
print(ans)

Solution (Python):
s = input()
sList = []
for i in range((len(s)+1)//2):
    sList.append(s[2*i])
print("".join(sList))

Solution (Python):
l = list(input())
for i in range(len(l)):
  if i % 2 == 0:
    print(l[i],end="")

Solution (Python):
s = input()
r = s[::2]
print(r)

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s = input()
S = ""
for i in range(0, len(s), 2):
  S = S[:] + s[i]
print(S)

Solution (Python):
N=input()
M=""
for i in range((len(N)+1)//2):
  M+=N[2*i]

print(M)

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()
ans = ""
for i in range (len(s)):
  if i % 2 == 0:
    ans += s[i]
  else:
    pass
print(ans)

Solution (Python):
s = list(input())
out = []

cnt =0

for i in s:
    if cnt%2 == 0:
        out.append(i)
    cnt += 1
 
print("".join(out))

Solution (Python):
try:
    s = input()
    print(s[::2])
except EOFError:
    pass

Solution (Python):
s = input()
print("".join(s[::2]))

Solution (Python):
s = input()
ans = [ s[i] for i in range(len(s)) if i%2 == 0]
print(''.join(ans))

Solution (Python):


import math


def main():
    S = input()
    print(S[::2])


if __name__ == "__main__":
    main()

Solution (Python):


import math


def main():
    S = list(input())
    for s in range(0, len(S), 2):
        print(S[s], end='')


if __name__ == "__main__":
    main()

Solution (Python):
s = input()
ans = ""
for i,word in enumerate(s):
    if i%2 == 0:
       ans += word
print(ans)

Solution (Python):
s = input()
ans = ""
for i in range(0,len(s),2):
  ans += s[i]
print(ans)

Solution (Python):
a = input()
print(a[::2])

Solution (Python):
s=input()
ans=[]

for i in range(len(s)):
    if i%2!=1:
        ans.append(s[i])

print("".join(ans))

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s = input()
ans = ""
for i in range(len(s)):
    if i%2==0:
        ans = ans+s[i]
print(ans)

Solution (Python):
s=list(input())
r=""
for x in range(len(s)):
    if x%2==0:r+=s[x]
print(r)

Solution (Python):
s = input()

for i in range(len(s)):
  if i % 2 == 0:
    print(s[i], end="")

Solution (Python):
s=str(input())
l=len(s)
Ans=str()
for i in range(l):
    if i%2 == 0:
        Ans= Ans +(s[i])
print(Ans)

Solution (Python):
s = input()
cou = []
for i in range(len(s)): 
    if (i+1)%2 == 1:
        cou.append(s[i])
print(''.join(cou))

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s = list(input())
ans = []
for i, _s in enumerate(s):
    if not i % 2:
        ans += [_s]
print(''.join(ans))

Solution (Python):
s=input()
ss=''
for i in range(0,len(s),2):
	ss+=s[i]
print(ss)

Solution (Python):
s = list(map(str,input()))
ans = []

for i in range(0,len(s),2):
 	ans.append(s[i])

print(''.join(ans))

Solution (Python):
s=input()
n=len(s)
ans=""
for i in range(n):
  if i%2==0:
    ans += s[i]
print(ans)

Solution (Python):
s = input()

s_odd = [s[i] for i in range(len(s)) if i%2 == 0]
print("".join(s_odd))

Solution (Python):
s = input()

print(s[0:len(s):2])

Solution (Python):
S = input()
ans = ''
for i in range(len(S)):
    if i % 2 == 0:
        ans += S[i]
print(ans)

Solution (Python):
print(str(input())[::2])

Solution (Python):
s = input()
res = ""
for i in range(len(s)):
    if(i % 2 != 0):
        continue
    res = res + s[i]
print(res)

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
a=list(input())
b=0
while True:
    print(a[b],end="")
    b=b+2
    if b > len(a)-1:
        break

Solution (Python):
a = input()
print(a[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()
S =""

for i in range(len(s)):
    if i % 2 == 0:
        S = S+s[i]

print(S)

Solution (Python):
s = input()
ans = []
for i, j in enumerate(s, 1):
	if i % 2 != 0:
		ans.append(j)

print("".join(ans))

Solution (Python):

s = input()
ans = ''
for i in range(len(s)):
    if i%2 == 0:
        ans += s[i]

print(ans)

Solution (Python):
s = input()
for i in range(0,len(s),2):
  print(s[i],end = '')

Solution (Python):
s=input()
s1=""

for i in range(len(s)):
    if (i%2==0):
        s1="".join((s1,s[i]))
print(s1)

Solution (Python):
"""
author : halo2halo
date : 30, Jan, 2020
"""

import sys


import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

s = readline().decode('utf8').rstrip()

print(s[::2])

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s = list(input())
list=[]
for i in range(len(s)):
    if i%2==0:
        list.append(s[i])
print(*list, sep="")

Solution (Python):
print(input()[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()

for i in range(0, len(s), 2):
    print(s[i], end='')

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    s=STR()
    sl=len(s)
    ans=[]
    if sl%2==0:
        for i in range(sl//2):
            ans.append(s[2*i])
    else:
        for i in range(sl//2+1):
            ans.append(s[2*i])
            
    print(*ans, sep='')
        
if __name__ == '__main__':
    do()

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s = input()
ans = ""
for i in range(len(s)):
    if i%2 == 0:
        ans += s[i]
print(ans)

Solution (Python):
s = input()

print(s[0::2])

Solution (Python):
n = input()
ans = ""
for i in range(len(n)):
  if i%2 == 0:
    ans += n[i]
print(ans)

Solution (Python):
s = input()
ans = ""
for i in range (len(s)):
  if i % 2 == 0:
    ans += s[i]
  else:
    pass
print(ans)

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s = list(str(input()))
length = int((len(s)+1)/2)
pick = [0]*length

for i in range(length):
  pick[i] = s[2*i]

print(''.join(pick))

Solution (Python):
s = input()
for i in range(len(s)):
    if i % 2 == 0:
        print(s[i], end="")
print("\n")

Solution (Python):
s = input()
answer = ''
for i in range(len(s)):
    if i % 2 == 0:
        answer += s[i]

print(answer)

Solution (Python):
s = input()

print(s[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
s=input()
print(s[0::2])

Solution (Python):
s = str(input())
s = list(s)

for i in range(len(s)):
    if i % 2 == 0:
        print(s[i],end = '')

print('')

Solution (Python):
print(input()[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
s=input()
ans=[]
for i in range(len(s)):
  if i%2==0:
    ans.append(s[i])
print("".join(ans))

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s = input()
ans = ""
for i in range(1,len(s)+1):
    if i%2 !=0:
        ans = ans+s[i-1]
        
print(ans)

Solution (Python):
s=str(input())
sx=[i for i in s]
l=len(sx)
x=[]
y=[]
for i in range(l):
    if i%2==0:
        x.append(sx[i])
    else:
        y.append(sx[1])
print("".join(x))

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s = input()
ans = ''
for i in range(0,len(s),2):
    ans = ans + s[i]
print(ans)

Solution (Python):
s = input()

ans = ''
for i in range(len(s)):
    if i % 2 == 0:
        ans += s[i]
print(ans)

Solution (Python):
s = input()

print(s[::2])

Solution (Python):
s = input()
res = ""
for letter in s[0::2]:
    res += letter
print(res)

Solution (Python):
n=input()
print(n[::2])

Solution (Python):
s = list(input())
l = len(s)
k = []
for i in range(0,len(s),2) :
    k.append(s[i])
K = ''.join(k)
print(K)

Solution (Python):
s = input()

ans = ""
for i in range(len(s)):
  if (i+1) % 2 != 0:
    ans += s[i]
  
print(ans)

Solution (Python):


import numpy as np


print(input()[::2])

Solution (Python):


import numpy as np


s=input()
for i in range(len(s)):
    if(i%2==0):
        print(s[i],end="")
print()

Solution (Python):
print(input()[::2])

Solution (Python):
s=input()

print(s[::2])

Solution (Python):
s = input()

print(s[0::2])

Solution (Python):
s = input()
t = [ s[i] for i in range(len(s)) if i % 2 == 0]
print("".join(t))

Solution (Python):
s = input()
print(s[0::2])

Solution (Python):
s=input()
print(s[::2])

Solution (Python):
s = input()

even = 0
strArray = []
for i in range(len(s)):
    if i % 2 == 0:
        even = i
        strArray.append(s[even])

print("".join(strArray))

Solution (Python):
print(input()[::2])

Solution (Python):
s = list(input())
out = []
for i in range(len(s)):
    if (i+1)%2 ==1 :
       out.append(s[i]) 

out = ''.join(out)
print(out)

Solution (Python):
s = input()

S = list(s)
ans=[]
for i in range(0, len(S)):
    if i%2==0:
        ans.append(S[i])

Ans = '' .join(ans)
print(Ans)

Solution (Python):
print(input()[::2])

Solution (Python):
import sys
input = sys.stdin.readline
s = list(input().rstrip())
S = s[::2]
print("".join(S))

Solution (Python):
s=input()
li = []

for index, i in enumerate(s):
  if (index + 1) % 2 == 0:
    continue
  li.append(i)

print("".join(li))

Solution (Python):

s = input()
print(s[::2])

Solution (Python):
S=input()
print(S[::2])

Solution (Python):
s = input()
n = len(s)
S = ''

for i in range(0, n, 2):
    S += s[i]
print(S)

Solution (Python):
s = input()

res = ""

for i in range((len(s)+1)//2):
    res += s[2*i]
print(res)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

s = input()

print(s[::2])

Solution (Python):
S = input()
mylist = []
count = len(S)
moji=""
for i in range(count):
    if i%2==0:
        mylist.append(S[i])
    else:
        pass
for i in mylist:
    moji += i
print(moji)

Solution (Python):



S = input()

for i in range(0, len(S), 2):
    print(S[i], end="")

Solution (Python):
print(input()[::2])

Solution (Python):


s = input()

ans = ""
for i in range(len(s)):
    if (i+1)%2 == 1:
        ans += s[i]

print(ans)

Solution (Python):
s=input()
for n,i in enumerate(s):
    if n%2 ==0:
        print(i,end="")

Solution (Python):
S = input()

print(S[::2])

Solution (Python):
s = str(input())
lst = s[0::2]

print(''.join(lst))

Solution (Python):
s=input()
ss=[]
for i in range(len(s)):
  if i%2==0:
    ss.append(s[i])
print("".join(ss))

Solution (Python):
s = list(str(input()))
for i in range(len(s)):
    if not i%2:
        print(s[i],end="")

Solution (Python):
s = input()
ans = s[::2]
print(ans)

Solution (Python):

s = list(str(input()))

for i in range(0, len(s), 2):
    print(s[i], end = "")

Solution (Python):
S=input() 
for i in range(0,len(S),2):
    print(S[i],end="")

Solution (Python):

s=input()
ans=""
for i in range(len(s)):
    if (i+1)%2==1:
        ans+=s[i]
print(ans)

Solution (Python):
S = list(input())

s = ""
for i in range(len(S)):

    if i%2==0:
        s = s + S[i]

print(s)

Solution (Python):
s = input()
lista=[]
pares=[]
resultado=''
for loop in s:
    lista.append(loop)
for analise in range(0,len(lista)):
    if analise % 2 == 0:
        pares.append(lista[analise])
for final in pares:
    resultado+=final
print(resultado)

Solution (Python):
s = input()
sz = len(s)
a = ""
for x in range(sz):
	if x%2 == 0:
		a += s[x]
print(a)

Solution (Python):
string = ""
for i, j in enumerate(input()):
    if i%2 == 0:
        string += j

print(string)

Solution (Python):
s=input()
ans=''
for i in range(0,len(s),2):
    ans+=s[i]
print(ans)

Solution (Python):
st = input()
r = st[0::2]
print(r)

Solution (Python):

 
import math
import itertools
import sys
import copy
 




s = str(input())

ans = ""
for i in range(len(s)) :
  if (i+1) % 2 != 0 :
    ans += s[i]
print (ans)

Solution (Python):
def main():
    S = list(input())
    for i in range(len(S)):
        if i % 2 == 0:
            print(S[i], end='')

if __name__ == '__main__':
    main()

Solution (Python):
S = input()

print(S[0::2])

Solution (Python):
s=input()
ans=""
for i in range(len(s)):
    if i%2==0:
        ans+=s[i]
print(ans)

Solution (Python):
print(input()[0::2])

Solution (Python):
a = input()
print(a[::2])

Solution (Python):
s=input()
print(s[0:len(s):2])

Solution (Python):
s=input()
l=len(s)
t=""
for i in range(l):
    if i%2==0:
        t+=s[i]
print(t)

Solution (Python):
s=str(input())
kotae=''
for i in range(0,len(s),2):
  kotae += s[i]
print(kotae)

Solution (Python):
print(input()[0::2])

Solution (Python):
S = list(input())
for v in S[0::2]:
    print(v, end="")

Solution (Python):
import sys

s = sys.stdin.readline().rstrip()

def main():
    return s[::2]

if __name__ == '__main__':
    ans = main()
    print(ans)

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
print(input()[0::2])

Solution (Python):
s = list(input())
ans = str()
for i in range(len(s)):
    if i % 2 == 0:
        ans += s[i]
print(ans)

Solution (Python):
s=input()
print(s[0::2])

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s=input()
for i in range(0,len(s),2):
  print(s[i],end="")

Solution (Python):
import math

print(input()[0::2])

Solution (Python):
s=input()
a=[]
b=""
if len(s)%2==0:
    n=len(s)//2
else:
    n=len(s)//2+1
for i in range(n):
    a.append(2*i)
    b+=s[a[i]]
print(b)

Solution (Python):
S = input()
R = ""
for i in range(0, len(S), 2):
  R += S[i]
print(R)

Solution (Python):
s = input()

ans = []
for i in range(0, len(s), 2):
    ans.append(s[i])
    
print("".join(ans))

Solution (Python):
s=list(input())
sodd=s[0::2]
print(''.join(sodd))

Solution (Python):
s=input()
ans=""
for ind,moji in enumerate(s):
    if(ind%2==0):
        ans+=moji
print(ans)

Solution (Python):
s = list(input())
for i in range(0,len(s),2):
    print(s[i],end="")
print()

Solution (Python):
s = input()
ans = ''
for i in range(len(s)):
    if i % 2 == 0:
        ans += s[i]
print(ans)

Solution (Python):
print(input()[0::2])

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s = list(input())
ans = ''
for i in range(len(s)):
    if i % 2 == 0:
        ans += s[i]
print(ans)

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()
l = []
for idx,i in enumerate(s):
    if idx % 2 == 0:
        l.append(i)
        
print(''.join(l))

Solution (Python):
s = input()
ans = ''
for i in range(0, len(s), 2):
    ans += s[i]
print(ans)

Solution (Python):
print(input()[0::2])

Solution (Python):
a = input()

print(a[0:len(a):2])

Solution (Python):
s = str(input())

ans = s[::2]
print(ans)

Solution (Python):
print(input()[0::2])

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
s = list(input())
l = []

for i in range(len(s)):
    if i % 2 == 0:
        l.append(s[i])

print("".join(l))

Solution (Python):
S = input()

s_odd = [c for i, c in enumerate(S) if i % 2 == 0]

print(''.join(s_odd))

Solution (Python):
print(input()[0::2])

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()

print(s[::2])

Solution (Python):
s=list(input())
ans=""
for i in range(1,len(s)+1):
    if i%2==1:
        ans+=s[i-1]
print(ans)

Solution (Python):
line = input()
count = len(line)
if count % 2 == 0:
  for i in range(0 ,count - 1 ,2):
    print(line[i],end ="")
else:
  for i in range(0 ,count ,2):
    print(line[i],end ="")

Solution (Python):
s = list(input())
ans = "".join(s[0::2])
print(ans)

Solution (Python):
s=input();print(s[::2])

Solution (Python):
s = input()
l = []
for i in range(len(s)):
  if (i + 1) % 2 != 0:
    l.append(s[i])
print("".join(l))

Solution (Python):
s=input()
print(s[0:len(s):2])

Solution (Python):
print(input()[::2])

Solution (Python):
S = list(input())
print("".join(S[::2]))

Solution (Python):

s = input()
print(s[0::2])

Solution (Python):
s = input()

ls_ans = []

for i in range(len(s)):
    if i % 2 == 0:
        ls_ans.append(s[i])

print("".join(ls_ans))

Solution (Python):
from sys import stdin

s = list(input())
result = ""

for ch in range(0,len(s)):
    if (ch + 1) % 2 != 0:
        result += s[ch]
    else:
        pass

print(result)

Solution (Python):
S = list(input())
for num in range(0,len(S),2):
    print(S[num], end="")

Solution (Python):
import sys
s = sys.stdin.readline()
print(''.join([s[i] for i in range(len(s)) if i % 2 == 0]))

Solution (Python):
s = input()
print(''.join([s[i] for i in range(len(s)) if i % 2 == 0]))

Solution (Python):
a = input()
print("".join(a[::2]))

Solution (Python):
s=input()
print(s[::2])

Solution (Python):
s = input()
counter = 0
res = []
for i in s:
  counter += 1
  if counter % 2 != 0:
    res.append(i)
print("".join(res))

Solution (Python):
s = input()
ss = ""
for i in range(len(s)):
    if i % 2 == 0:
        ss = ss + s[i]

print(ss)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    ans="".join(c for c in input()[::2])
    print(ans)

main()

Solution (Python):
s = input()

list_s = list(s)
ans_s = ""

for i in range(0, len(s), 2):
    ans_s += list_s[i]

print(ans_s)

Solution (Python):
S = input()
ans = [S[i] for i in range(0, len(S), 2)]
print("".join(ans))

Solution (Python):
s = input()
r = ''
for i, si in enumerate(list(s)):
  if (i + 1) % 2 != 0:
  	r += si
print(r)

Solution (Python):

s = input()
t = ""
for i in range(len(s)):
    if i % 2 == 0:
        t = t + s[i]
    else:
        pass
print(t)

Solution (Python):
s = input()
ans = ''

for i in range(len(s)):
    if i % 2 == 0:
        ans += s[i]
        
print(ans)

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()
odd_string = s[::2]

print(odd_string)

Solution (Python):
s = input()
odd_string = ""

for i, c in enumerate(s):
    if i % 2 == 0:
        odd_string += c

print(odd_string)

Solution (Python):
s = str(input())

ans = s[0::2]
print(ans)

Solution (Python):
print(input()[::2])

Solution (Python):
import sys

def main():
    s = sys.stdin.readline().rstrip()
    res = s[::2]
    print(res)

if __name__ == '__main__':
    main()

Solution (Python):


s=input()
print(s[::2])

Solution (Python):
s = input()
ans = ""
for i,word in enumerate(s):
    if i%2 == 0:
        ans += s[i]
    else:
        continue
print(ans)

Solution (Python):
S = list(input())

res = [v for idx, v in enumerate(S, start=1) if (idx) % 2 != 0]
print(''.join(res))

Solution (Python):
s=input()
print(s[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
from sys import stdin
s = stdin.readline().rstrip()

e = ""
for i in range(len(s)):
    if i%2 == 0:
        e += s[i]
print(e)

Solution (Python):
s=input()
print(s[::2])

Solution (Python):

s = input()

n = len(s)
ans = ""

for i in range(n):
    if i % 2 == 0:
        ans += s[i]
print(ans)

Solution (Python):
s = input()
x = len(s)
string = ""

for i in range(x):
    if i % 2 == 0:
        string += s[i]
print(string)

Solution (Python):
s = list(map(str, input()))
cnt = 0
ans = []
for i in s:
    cnt += 1
    if cnt % 2 == 1:
        ans.append(i)
print(''.join(ans))

Solution (Python):
s = input()

k = len(s)


ans = ''

for i in range(k):
	if i%2 == 0:
		ans = ans + s[i]
	else:
		pass
		
print(ans)

Solution (Python):
s=input()
slis=[]
for i in range(len(s)):
	if i%2 ==0:
		slis.append(s[i])
print(*slis,sep="")

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
word = input()
list = []
n = 0
while n + 1 <= len(word):
    list.append(word[n])
    n += 2


for j in list:
    print(j, end="")

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
n=input()
print(n[0::2])

Solution (Python):
s=input()
print(s[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
s=input()
print(s[0::2])

Solution (Python):
print(input()[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()
ans = ''
for i in range(len(s)):
    if i % 2 == 1:
        continue
    ans += s[i]
print(ans)

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()
a= ""
for i in range(len(s)):
    if i % 2 == 0:
        a += s[i]
print(a)

Solution (Python):
string = input()
for i, char in enumerate(string):
    if (i+1) % 2 == 1:
        print(char, end="")

Solution (Python):
def examB():
    St = S()
    ans = St[::2]
    print(ans)

import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examB()

Solution (Python):
s = input()
print(s[::2])

Solution (Python):
print(input()[::2])

Solution (Python):
def main():
  s = list(input())
  answer = ''
  for i in range(len(s)):
    if i % 2 == 0:
      answer += s[i]
  print(answer)

main()

Solution (Python):
s = input()
print (s[0::2])

Solution (Python):
s = list(str(input()))
ans = ''

for i in range(len(s)):
  if i % 2 == 0:
    ans += s[i]
    
print(ans)

Solution (Python):
A = input()
a =[A[i] for i in range(0,len(A),2)]
print(','.join(a).replace(',',''))

Solution (Python):
s = input()
p = ""
for i in range(0, len(s)):
    if i % 2 == 0:
        p += s[i]
print(p)

Solution (Python):
s=list(input())
s2=''
for i in range(len(s)):
  if i%2==0:
    s2+=s[i]
print(s2)

Solution (Python):
s = input()
ans = ""
for i, st in enumerate(s):
    if i%2 == 0:
        ans += st
print(ans)

Solution (Python):
s=list(input())
A=''
for i in range(len(s)):
    if i%2==0:
        A+=s[i]

print(A)

Solution (Python):
print(''.join([s for s in input()[::2]]))

Solution (Python):
s=list(input())
s_join="".join([s[i] for i in range(len(s)) if (i+1)%2==1 ])
print(s_join)

Solution (Python):
s=input()
for i in range(len(s)):
  if i%2==0:
    print(s[i],end="")

Solution (Python):
s = input()
ans = ''
for i in range(len(s)):
    if i % 2 == 0:
        ans += s[i]
print(ans)

Solution (Python):
print(input()[::2])

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
s = list(input())
ans=[]
for i in range(len(s)):
    if i%2 == 0:
        ans.append(s[i])
print(''.join(ans))

Solution (Python):
print(str(input())[::2])

Solution (Python):
string = list(input())
i = 0
ans = ''
for S in string:
    if i == len(string):
        break
    elif ((i+1) % 2 == 1):
        ans = ans + S
    elif ((i+1) % 2 == 0):
        pass
    i += 1
print(ans)

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

s = input()
print(s[::2])

Solution (Python):
s = list(input())

l = [s[i] for i in range(len(s)) if i % 2 == 0]

for i in l:
    print(i, end='')

Solution (Python):
S=input()
print(S[::2])

Solution (Python):
s=str(input())
kotae=''
for i in range(0,len(s),2):
  kotae += s[i]
print(kotae)

Solution (Python):
s = list(input())
array = []
for i in range(len(s)):
    if i % 2 == 0:
        array.append(s[i])
        

print("".join(array),end="")

Solution (Python):
s = list(input())
array = []
for i in range(len(s)):
    if i % 2 == 0:
        array.append(s[i])
        

print("".join(array),end="")

Solution (Python):
s = input()
ans = s[::2]

print(ans)

Solution (Python):
import sys

s = sys.stdin.readline().rstrip()

print(''.join([s[i] for i in range(len(s)) if i % 2 == 0]))

Solution (Python):
s = input()

ans = s[::2]
print(ans)

Solution (Python):
print(input()[::2])

Solution (Python):
s = list(input())
print("".join(s[::2]))

Solution (Python):
s = input()
FF = lambda x: [x[i] for i in range(len(x)) if (i+1) % 2 != 0]
BA = FF(s)
BA
print("".join(BA))

Solution (Python):
s = input()
ans = [s[i] for i in range(len(s)) if i%2 == 0]
print(''.join(ans))

Solution (Python):
s = input()
for i in range(0,len(s),2):
    print(s[i],sep="",end="")

Solution (Python):
s=str(input())
length =len(s)
sen=''

for i in range(length):
  if i % 2 ==0:
    sen=sen+s[i]

print(sen)

Solution (Python):
s = input()
bag = []
for i in range(len(s)):
    if (i + 1) % 2 != 0:
        bag.append(s[i])
print("".join(bag))

Solution (Python):
print(input()[::2])

Solution (Python):
s = input()
array = list(s)
l = len(array)
odd = array[0:l + 1:2]
for c in odd:
    print(c,end='')

Solution (Python):
s=input()
a=''
for i in range(len(s)):
    if i % 2 == 0:
        a += s[i]
print(a)

Solution (Python):
print(input()[::2])

Solution (Python):
s=list(input())
ans=''
for i in range(len(s)):
    if i%2==0:
        ans+=s[i]
print(ans)

Solution (Python):
s = input()
tmp = list(range(0,len(s),2))
ans = []
for i in tmp:
    ans.append(s[i])
print("".join(ans))

Solution (Python):
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(inputs):
    s = inputs[0]

    ret = []
    for i, c in enumerate(s):
        if i % 2 == 0:
            ret.append(c)
    return ''.join(ret)


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Solution (Python):
s = input()
k = [s[i] for i in range(0,len(s),2)]
k = "".join(k)
print(k)