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):
s = input()
print(s[::2])

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

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

print(ans)

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

print(S[::2])

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

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

def listtostring(some):
    str1 = ""

    for ele in some:
        str1 += ele

    print(str1)

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

listtostring(even)

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

Solution (Python):
a = list(input())
a_135 = a[0::2]
mojiretu = ''.join(a_135)
print(mojiretu)

Solution (Python):
s=input()

print(s[::2])

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

print(s[::2])

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



print(s[::2])

Solution (Python):
s = input()

ans = [i for index, i in enumerate(s, start = 1) if index % 2 != 0]
print("".join(ans))

Solution (Python):
s = input()

N = len(s)
result = []

for i in range(0, N):
    if i == 0 or i % 2 == 0:
        result.append(s[i])

s = ''
N = len(result)

for i in range(0, N):
    s += result[i]

print(s)

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



print(s[::2])

Solution (Python):
s = input()

N = len(s)
result = []

for i in range(0, N):
    if i == 0 or i % 2 == 0:
        result.append(s[i])

s = ''
N = len(result)

for i in range(0, N):
    s += result[i]

print(s)

Solution (Python):
s = input()

N = len(s)
result = []

for i in range(0, N):
    if i == 0 or i % 2 == 0:
        result.append(s[i])

s = ''
N = len(result)

for i in range(0, N):
    s += result[i]

print(s)

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

Solution (Python):
s = str(input())
def answer(s: str) -> str:
    ans = ''
    for i in range(len(s)):
        if i % 2 == 0:
            ans += s[i]
    return ans


print(answer(s))

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

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

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

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

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

Solution (Python):
s = input()

print(s[::2])

Solution (Python):
s = input()

print(s[::2])

Solution (Python):
S = input()

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

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

print(s[::2])

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

Solution (Python):



from math import gcd
from itertools import combinations,permutations,accumulate, product 

from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect
import heapq














import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7


INF = float('inf')
from sys import stdin
readline = stdin.readline
def readInts():
  return list(map(int,readline().split()))
def readTuples():
    return tuple(map(int,readline().split()))
def I():
    return int(readline())
s = input()
print(s[::2])

Solution (Python):

S = str(input())

print(S[::2])

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

Solution (Python):

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

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

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

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

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

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

print(ans)

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

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

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

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

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

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

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

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

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

Solution (Python):
S = str(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):
s = list(input())
print(''.join(s[0::2]))

Solution (Python):


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

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

Solution (Python):
S = input()
S1 = '0' + S
print(S1[1::2])

Solution (Python):
s = list(input())
l = int(len(s))

m = []
for i in range(0, l, 2): 
    m.append(s[i])
print(''.join(m))

Solution (Python):
class Odd:
    def __init__(self,s:str):
        self.s=s

    def odd_str(self):
        m=[]
        l=int(len(self.s))
        for i in range(0,l,2):
            m.append(self.s[i])
        print(''.join(m))

odd1=Odd(input())
odd1.odd_str()

Solution (Python):
s = input()

print(s[0::2])

Solution (Python):
s = input()

n = (len(s) + 1) // 2

ans = ''

for i in range(n):
   ans += s[2 * i]

print(ans)

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

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

Solution (Python):
s = str(input())
k = 0
odd = ""

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

print(odd)

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

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

Solution (Python):
s = input()


print(s[::2])

Solution (Python):
'''
問題：
    英小文字からなる文字列 s が与えられます。
    前から数えて奇数文字目だけ抜き出して作った文字列を出力してください。
    ただし、文字列の先頭の文字を1文字目とします。
'''

'''
制約：
    s の各文字は英小文字
    1 ≦ |s| ≦ 100000
'''


s = str(input())

i = 1
result = ""
for i in range(len(s) + 1):
    if i % 2 == 0:
        pass
    else:
        result += s[i - 1]

print(result)

Solution (Python):





s = input()




print(s[0::2])

Solution (Python):
S = input()
count = 1
str_odd = ''

for i in S:
    if count % 2 == 1:
        str_odd += i
    count += 1

print(str_odd)

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

Solution (Python):
s = input()
i = 0
answer = str()
for j in s:
    if i % 2 == 0:
        answer += j
    i += 1
print(answer)

Solution (Python):
s=input()

print(s[0::2])

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

for i, letter in enumerate(s): 
    if i % 2 == 0: 
        letters += letter 

print(letters)

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

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

Solution (Python):
s = input()

print(s[::2])

Solution (Python):





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

Solution (Python):
s = input()
i = 0
answer = str()
for j in s:
    if i % 2 == 0:
        answer += j
    i += 1
print(answer)

Solution (Python):


s = str(input())


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

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

Solution (Python):









s = str(input())



print(s[::2])

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

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

Solution (Python):
s = input()
s.split()
odd = []

for i in range(len(s)):
    if i % 2 == 0:
        odd.append(s[i])
answer = ''.join(odd)

print(answer)

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

Solution (Python):
s = input()

print(s[0::2])

Solution (Python):





s = input()

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

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

print(''.join(s[0::2]))

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

new_list = ""

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

print(new_list)

Solution (Python):



s = input()
j = 0
m = ''
for i in s:
    j += 1
    if j % 2 == 1:
        m += i

print(m)

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

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

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

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

Solution (Python):

s = list(input()) 

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

print(''.join(out))

Solution (Python):
s = input()

n: int = 0
odds = ""


for i in s:
    if n % 2 == 0:
        odd = s[n]
        odds += odd
    elif n == 0:
        odd = s[n]
        odds += odd
    else:
        pass
    n += 1
    
print(odds)

Solution (Python):


in_s = list(input())

out_ss = ""

for i, new in enumerate(in_s):
    if i % 2 == 0:
        out_ss += new

print(out_ss)

Solution (Python):
s = input()
n_s =''
for n in range(0,len(s),2):
    n_s = n_s + s[n]

print(n_s)

Solution (Python):
s = input()

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

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

Solution (Python):
s = input()
print(s[0: :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):
print(input()[::2])

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

Solution (Python):



s = input()

result = ''
i = 0
while i < len(s):
    result += s[i]
    i += 2

print(result)

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

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

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

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

answer = "".join(odd_num)
print(answer)

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

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

for i in range(len(s)):

    if i % 2 == 0:
        odd_num.append(s[i])

answer = ''.join(odd_num)
print(answer)

Solution (Python):
def answer(s: str) -> str:
    return s[::2]


def main():
    s = input()
    print(answer(s))


if __name__ == '__main__':
    main()

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



print(s[::2])

Solution (Python):
S = str(input())
ls = len(S)
odd_list = []
result = ""

while ls > 0:
    ls -= 1
    if ls % 2 == 0:
        odd_list.append(ls)
odd_list = sorted(odd_list)


for i in odd_list:
    result = result + S[i]
print(result)

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

Solution (Python):
s = input()

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

print("".join(s_odd))

Solution (Python):

class Atc_072b:
    def __init__(self, s: str) -> str:
        self.s = s

    def odd(self):
        s_odd = ""
        for i in range(0, len(self.s)):
            if i % 2 == 0:
                s_odd += self.s[i]
        return s_odd


s_input = input()
print(Atc_072b(s_input).odd())

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

Solution (Python):

s = list(input())



print(''.join(s[0::2]))

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

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

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

Solution (Python):

class Atc_072b:
    def __init__(self, s: str) -> str:
        self.s = s

    def odd(self):
        s_odd = ""
        for i in range(0, len(self.s)):
            if i % 2 == 0:
                s_odd += self.s[i]
        return s_odd
    

s_input = input()
print(Atc_072b(s_input).odd())

Solution (Python):

s = input()
a = []
if s.islower() and 1 <= len(s) and len(s) <= 10 ** 5:
    b=""
    for n in range(len(s)):
        if n % 2 == 0:
            a.append(s[n])
    for m in range(len(a)):
        b=b+a[m]
    print(b)

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

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

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

Solution (Python):

ori_str = str(input())
strnum = len(ori_str)


odd_str = ""
for cnt in range(0,strnum,2):
    odd_str += ori_str[cnt]
print(odd_str)

Solution (Python):
word = input()
test = [n for i, n in enumerate(word) if i % 2 == 0]
print(''.join(test))

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

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

def ans072(s:str):
    ans_str=""
    for i in range(0,len(s)):
        if i%2==0:
            ans_str=ans_str+s[i]
    return ans_str

print(ans072(s))

Solution (Python):
s = input()

count = 0
result = ""

for x in s:
    count = count +1
    if count % 2 == 1:
        result = result + x
else:
    print(result)

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):

s=list(input())
data=s[0]
i=1
while i*2<len(s):
    data=data+s[i*2]
    i=i+1
print(data)

Solution (Python):

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

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

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

Solution (Python):
s = input()

res = ''
for i, elem in enumerate(s):
  if i % 2 == 0:
    res += elem
print(res)

Solution (Python):
n=input()
a = []
a.append(str(n[:len(n):2]))
print(*a)

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

Solution (Python):
S = list(input())
ans = []
for i in range(1,len(S) + 1,2):
    ans.append(S[i - 1])
print("".join(ans))

Solution (Python):
S = input()
print("".join([s for i,s in enumerate(S) if i%2==0]))

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

print(res)

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

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

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

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

print(ans)

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

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

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

Solution (Python):
s = input()

s_list = list(s)

mojiretu = ''.join(s_list[0::2])

print(mojiretu)

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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


if __name__ == '__main__':
    main()

Solution (Python):
import sys
s = sys.stdin.readline().rstrip("\n")
i = 0
ans = ''
for m in s:
    if i % 2 == 0:
        ans += m
    i += 1
print(ans)

Solution (Python):
import sys
def S(): return sys.stdin.readline().rstrip()


S = S()
print(S[::2])

Solution (Python):
import sys
def LS2(): return list(sys.stdin.readline().rstrip())  


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

print(ans)

Solution (Python):


S = input()
for i in range(len(S)):
    if i % 2 == 0:
        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):
s = input()
print(s[::2])

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

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

print(p)

Solution (Python):
S = input()

for s in S[::2]:
    print(s, end='')

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

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

Solution (Python):
s = input()

s_list = list(s)

mojiretu = ''.join(s_list[0::2])

print(mojiretu)

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

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

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

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

print(''.join(ans))

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

Solution (Python):
s = input()

ans = ""

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

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

Solution (Python):


s = list(input())

output=""
for i,ss in enumerate(s):
    if i % 2 == 0:
        output += ss

print(output)

Solution (Python):



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


if __name__ == "__main__":
    main()

Solution (Python):



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


main()

Solution (Python):
S = input()

answer = "".join([c for i, c in enumerate(S) if (i+1) % 2 == 1])
print(answer)

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

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

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

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

print(''.join(l))

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

Solution (Python):
s=input()

s_odd = ""

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

Solution (Python):
s=input()

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

Solution (Python):


str = input()
table = list(str)

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
s = input()

i = 1
ans = ''
for x in s:
    if i & 1:
        ans += x
    i += 1
print(ans)

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

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

print(s2)

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

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

Solution (Python):
s = input()

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

Solution (Python):
s = input()

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

print("".join(a))

Solution (Python):
s = input()
l = len(s)
o = l//2
S = ''

if l%2== 0:
    for i in range(o):
        S += s[2*i]
if l%2 == 1:
    for i in range(o+1):
        S += s[2*i]

print(S)

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

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

print(''.join(l))

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

for i in range(0,l,2):
    k.append(s_list[i])

s_joined = ''.join(k)

print("{}".format(s_joined))

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

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

Solution (Python):
S = input()

flag = True
ans = ""
for s in S:
    if flag:
        ans += s
    flag = not flag
print(ans)

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

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

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

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

Solution (Python):
s = list(map(str, input()))
ans = ''
for i in range(len(s)):
  if (i+1)%2==1:
	  ans += s[i]

print(ans)

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

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

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

Solution (Python):
import sys
s = list (input ())
t = (s[::2])
for i in range (len(t)):
  sys.stdout.write(t[i])
  sys.stdout.flush()

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

for i in range(len(s)):
  if i%2==1:
    s[i]=''
  
ss=''.join(map(str,s))

print(ss)

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()
List = []
for i in range(len(S)):
    if i % 2 == 0:
        List.append(S[i])
print(''.join(List))

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

Solution (Python):
s=input()

print(s[::2])

Solution (Python):
s = input()

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

Solution (Python):
s = input()


i = list(range(0,len(s)+1,2))
temp =""
for t in range((len(s)+1)//2):
    temp = temp+s[i[t]]

print(temp)

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

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

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()

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):
print(input()[::2])

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

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

Solution (Python):



import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """atcoder"""
        output = """acdr"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """aaaa"""
        output = """aa"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """z"""
        output = """z"""
        self.assertIO(input, output)

    def test_入力例_4(self):
        input = """fukuokayamaguchi"""
        output = """fkoaaauh"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    
    resolve()

Solution (Python):
s = input()
list = [] 
answer = ""

for i, j in enumerate(s):
    if i % 2 == 0:
        list.append(j)
    else:
        pass

print("".join(list))

Solution (Python):
s=input()
ans=""
for i in range(len(s)):
  if i%2==0:
    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,sep="")

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

Solution (Python):
ans=[]
c=1
for i in input():
  if(c%2==1):ans.append(i)
  c+=1
print(''.join(ans))

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

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

moji = []
if len(s)%2 == 0:
    for i in range(len(s)//2):
        moji.append(s[2*i])
else:
    for i in range((len(s)+1)//2):
        moji.append(s[2*i])
print("".join(moji))

Solution (Python):




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

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

Solution (Python):
def main():
	s = input()

	n = len(s)
	ans = ""

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

	print(ans)


  
if __name__ == "__main__":
  	main()

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

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

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

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

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

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

Solution (Python):










s = input()

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

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

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

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

Solution (Python):
S  = input()
ans = ''
for i in range((len(S)+1)//2):
    ans += S[2*i]
print(ans)

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

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

Solution (Python):
s = input()

ans = []

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

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

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

Solution (Python):
s=list(input())
n=len(s)
i=2
ans=s[0]
while i<=n-1:
    ans=ans+s[i]
    i+=2
print(ans)

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

Solution (Python):
s=input()

print(s[::2])

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

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

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

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

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

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

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

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

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

Solution (Python):
s = input()

print(s[::2])

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
s = S()
ans = collections.deque()
odd = True
for c in s:
    if odd:
        ans.append(c)
    odd = not odd
print(''.join(ans))

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 accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

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

print(t)

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

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

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

Solution (Python):
s=input()

print(s[::2])

Solution (Python):
s=input()

print(s[::2])

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

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

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

if len(s)%2 == 1:
	l = [0]*(len(s)//2 + 1)
	for i in range(len(s)//2 + 1):
		l[i] = s[2*i]
	L = ''.join(l)
	print(L)
else:
	l = [0]*(len(s)//2)
	for i in range(len(s)//2):
		l[i] = s[2*i]
	L = ''.join(l)
	print(L)

Solution (Python):
s=list(input())
L=[]
for i in range((len(s)+1)//2):
	L.append(s[2*i])

print(''.join(L))

Solution (Python):
s = input()

print(s[::2])

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    s = readline().strip()
    print(s[::2])
    
    return


if __name__ == '__main__':
    main()

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()


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

if __name__ == "__main__":
    main()

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

Solution (Python):
N = input()
NN = list(N)
N_l = len(N)

ans = []

for i in range(N_l):
  if i % 2 == 0:
    ans.append(NN[i])
  else:
    pass
    
print(''.join(ans))

Solution (Python):
S=[x for x in input()]
print(''.join(S[0::2]))

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

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

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    S = s_input()

    for i,s in enumerate(S):
        if i % 2 == 1:
            continue
        print(s,end='')

    print()

if __name__ == '__main__':
    main()