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



Sample input:
atcoder


Sample output:
acdr

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#072_B
s=input()
print(s[::2])

Submission status: Accepted

Solution code:
s = input()
l = []
for i in s[::2]:
    l.append(i)
print("".join(l))

Submission status: Accepted

Solution code:
S = input()

ans = []

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

for a in ans:
    print(*a, end='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Problem https://atcoder.jp/contests/abc072/tasks/abc072_b
# Python 2nd Try


class Problem:
    def __init__(self, problemstring):
        self.problemstring = problemstring
        self.length = len(self.problemstring)

    def solve(self):
        result = ''
        resultlist = []
        for j in range(0, self.length):
            if j % 2 == 0:
                resultlist.append(self.problemstring[j])
        result = ''.join(resultlist)
        return result


if __name__ == "__main__":
#    S = "atcoder"
#    print("{} => {}".format(S, Problem(S).solve()))
#    S = "aaaa"
#    print("{} => {}".format(S, Problem(S).solve()))
#    S = "z"
#    print("{} => {}".format(S, Problem(S).solve()))
    S = input()
    print(Problem(S).solve())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

    main(s)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

print(t)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

t = ""

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

print(input()[::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

s = input().strip()
#----------
for i in range(0,len(s),2):
    print(s[i],end="")

Submission status: Accepted

Solution code:
# Problem https://atcoder.jp/contests/abc072/tasks/abc072_b
# Python 1st Try
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]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

ans = ""

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
s = input()

odd = s[0::2]

print(odd)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(M)

Submission status: Accepted

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

Submission status: Accepted

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

cnt =0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import math


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
import math


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(S)

Submission status: Accepted

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

print("".join(ans))

Submission status: Accepted

Solution code:

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 30, Jan, 2020
"""

import sys

# import itertools
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])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

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

Submission status: Accepted

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

print(answer)

Submission status: Accepted

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

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

print('')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:


import numpy as np


print(input()[::2])

Submission status: Accepted

Solution code:


import numpy as np


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

print("".join(strArray))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

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

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

print("".join(li))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = input()
print(s[::2])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

res = ""

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

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

S = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

s = input()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

print(S[::2])

Submission status: Accepted

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

print(''.join(lst))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = list(str(input()))

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

Submission status: Accepted

Solution code:
S=input() #英小文字からなる文字列
for i in range(0,len(S),2):
    print(S[i],end="")

Submission status: Accepted

Solution code:
#072 b-oddstring
s=input()
ans=""
for i in range(len(s)):
    if (i+1)%2==1:
        ans+=s[i]
print(ans)

Submission status: Accepted

Solution code:
S = list(input())

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

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

print(s)

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

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

print(string)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#N = int(input())
s = str(input())

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

print(S[0::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print("".join(l))

Submission status: Accepted

Solution code:
S = input()

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

print(''.join(s_odd))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 ="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
s = input()
print(s[0::2])

Submission status: Accepted

Solution code:
s = input()

ls_ans = []

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

print("".join(ls_ans))

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ss)

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
s = input()

list_s = list(s)
ans_s = ""

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

print(ans_s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(odd_string)

Submission status: Accepted

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

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

print(odd_string)

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
import sys

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
##### 解けた #####

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

s = input()

n = len(s)
ans = ""

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

k = len(s)

#空白の宣言
ans = ''

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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))

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

Solution code:
s = list(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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