Problem:


Score : 100 points

Problem Statement

Snuke has a grid consisting of three squares numbered 1, 2 and 3.
In each square, either 0 or 1 is written. The number written in Square i is s_i.

Snuke will place a marble on each square that says 1.
Find the number of squares on which Snuke will place a marble.

Constraints

Each of s_1, s_2 and s_3 is either 1 or 0.

Input

Input is given from Standard Input in the following format:

s_{1}s_{2}s_{3}

Output

Print the answer.

Sample Input 1

101

Sample Output 1

2

A marble will be placed on Square 1 and 3.

Sample Input 2

000

Sample Output 2

0

No marble will be placed on any square.



Sample input:
101


Sample output:
2

Submission status: Accepted

Solution code:
B = str(input())
Num_lis = list(B)
flag  = 0
for i in Num_lis:
    if i == "1":
        flag += 1
print(flag)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template


S = li()
print(S.count('1'))

Submission status: Accepted

Solution code:
s = input()
cnt = 0

for i in range(len(s)):
  if s[i] == "1":
    cnt += 1
    
print(cnt)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n, a, b = LI()
    print(min(n*a,b))
    return

#B
def B():
    a = S()
    print(a.count("1"))
    return

#C
def C():
    n = II()
    a = list(str(n))
    a = list(map(int,a))
    if not n % sum(a):
        print("Yes")
    else:
        print("No")
    return

#D
def D():
    n = II()
    a = LI()
    ans = 0
    for a_ in a:
        while not a_ % 2:
            ans += 1
            a_ /= 2
    print(ans)
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    B()

Submission status: Accepted

Solution code:
import re

a = input()

count = 0
for i in range(len(a)):
    if(a[i] == '1'):
        count += 1
print(count)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    n,a,b = LI()
    print(min(n*a,b))
    return

#B
def B():
    s = S()
    print(s.count("1"))
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#I
def I_():
    return

#J
def J():
    return

#Solve
if __name__ == "__main__":
    B()

Submission status: Accepted

Solution code:
a = input()
b = 0
for i in range(len(a)):
    b += int(a[i])
print(b)

Submission status: Accepted

Solution code:
print(sum([int(a) for a in input()]))

Submission status: Accepted

Solution code:
a = input()
count = 0
for i in range(3):
    if a[i-1] == "1":
        count += 1
print(str(count))

Submission status: Accepted

Solution code:
s = input()
res = 0
for v in s:
  res += int(v)
print(res)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
str = input()
total = 0
for s in str:
    total += int(s)
print(total)

Submission status: Accepted

Solution code:
work = input()
a, b, c = work[:1], work[1:2], work[2:3]

cnt = 0
if a == '1':
    cnt += 1
if b == '1':
    cnt += 1
if c == '1':
    cnt += 1

print(cnt)

Submission status: Accepted

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

print(s.count("1"))

Submission status: Accepted

Solution code:
s = input()
ans = 0
if s[0] == "1":
  ans += 1
if s[1] == "1":
  ans += 1
if s[2] == "1":
  ans += 1
  
print(ans)

Submission status: Accepted

Solution code:
a = input()
ans = a.count("1")
print(ans)

Submission status: Accepted

Solution code:
#coding:UTF-8
s = input()
print(s.count("1"))

Submission status: Accepted

Solution code:
numbers = input()

num_list = [int(i) for i in numbers]
print(sum(num_list))

Submission status: Accepted

Solution code:
ret = list(filter(lambda x: x==1, map(int, list(input()))))
print(len(ret))

Submission status: Accepted

Solution code:
str=list(input())
s1=int(str[0])
s2=int(str[1])
s3=int(str[2])
print(s1+s2+s3)

Submission status: Accepted

Solution code:
S = input()
cnt = 0
for i in range(3):
  if S[i] == "1":
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
s = int(input())
i = 0
if(s//100==1):
    i = i + 1
    s = s - 100
if(s//10==1):
    i = i + 1
    s = s-10
if(s==1):
    i = i + 1
print(i)

Submission status: Accepted

Solution code:
s = input()
counter = 0
if s[0]=='1':
    counter+=1
if s[1]=='1':
    counter+=1
if s[2]=='1':
    counter+=1
print(counter)

Submission status: Accepted

Solution code:
s = input()
b = 0
for i in s:
    if i == "1":
        b += 1
print(b)

Submission status: Accepted

Solution code:
s = input()
count = 0
for i in s:
    if i == "1":
        count += 1
print(count)

Submission status: Accepted

Solution code:
s=input()
count=0
for char in s:
  if char == '1':
    count += 1
print(count)

Submission status: Accepted

Solution code:
value = sum(map(int, list(input())))
print(value)

Submission status: Accepted

Solution code:
a = input()

counter = 0
for i in range(3):
    if int(a[-1-i]) ==  1:
        counter += 1
print(counter)

Submission status: Accepted

Solution code:
numbers_list = list(map(int, input()))
print(numbers_list.count(1))

Submission status: Accepted

Solution code:
#ABC081A - Placing Marbles
a = input()
print(a.count('1'))

Submission status: Accepted

Solution code:
l=list(map(int, input()))
print(l.count(1))

Submission status: Accepted

Solution code:
s=input()
if s[0]=="0":
    count=0
else:
    count=1
if s[1]=="0":
    count+=0
else:
    count+=1
if s[2]=="0":
    count+=0
else:
    count+=1
print(count)

Submission status: Accepted

Solution code:
count = 0
a = input()
if(a[0]=="1"):
    count += 1
if(a[1]=="1"):
    count += 1
if(a[2]=="1"):
    count += 1

print(count)

Submission status: Accepted

Solution code:
s = input()
count = 0 if s[0] == '0' else 1
count += 0 if s[1] == '0' else 1
count += 0 if s[2] == '0' else 1
print(count)

Submission status: Accepted

Solution code:
print(4-len(input().split('0')))

Submission status: Accepted

Solution code:
a, b, c = input()
print(int(a) + int(b) + int(c))

Submission status: Accepted

Solution code:
sss = list(input())

ans = 0
for s in sss:
    if s == '1':
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
T = input()
a = 0

for i in range(3):
    if int(T[i])==1:
        a += 1

print(a)

Submission status: Accepted

Solution code:
sss=list(input())
print(sss.count('1'))

Submission status: Accepted

Solution code:
c = 0
s = input()
if s[0] == "1":
    c += 1
if s[1] == "1":
    c += 1
if s[2] == "1":
    c += 1
print(c)

Submission status: Accepted

Solution code:
c = input()
print(c.count('1'))

Submission status: Accepted

Solution code:
s = input()
count = 0
for str in s:
    if str == '1':
        count += 1

print(count)

Submission status: Accepted

Solution code:
cnt = 0
s = input()
for i in s:
    if i == '1':
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
li = list(input())
ans = 0
for i in li:
    if int(i) == 1:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
a = input()
b = 1
c = 0
for b in range(3):
    if int(a[b]) == 1:
        c += 1
print(c)

Submission status: Accepted

Solution code:
n = input()

print(n.count("1"))

Submission status: Accepted

Solution code:
s = input()
a, b, c = map(int, [s[0:1], s[1:2], s[2:3]])
print(a+b+c)

Submission status: Accepted

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

str = input()

count = 0
for i in range(3):
    if str[i] == "1":
        count+=1
print(count)

Submission status: Accepted

Solution code:
masu = input() #1 3 5
n=0
for i in range(3):
    if masu[i] == "1":
        n += 1
print(n)

Submission status: Accepted

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

s = input()

print(s.count("1"))

Submission status: Accepted

Solution code:
input_str = input()
result = 0
for i in input_str:
  if i == '1':
    result +=1
print(result)

Submission status: Accepted

Solution code:
s = input()
count = s.count('1')   
print(count)

Submission status: Accepted

Solution code:
s = input()
count = 0
for str in s:
  if str == '1':
    count += 1
    
print(count)

Submission status: Accepted

Solution code:
S=input()
print(sum(list(map(int,S))))

Submission status: Accepted

Solution code:
s1, s2, s3 = map(int, input())
ans = s1 + s2 + s3
print(ans)

Submission status: Accepted

Solution code:
s = input()

count = 0
for i in range(3):
	if s[i:i+1]=='1':
		count += 1

print(count)

Submission status: Accepted

Solution code:
count = 0
s = input()
for i in range(3):
  if s[i] == '1':
    count += 1
print(count)

Submission status: Accepted

Solution code:
import numpy as np

a = str(input())
s1 = int(a[0])
s2 = int(a[1])
s3 = int(a[2])

print(np.sum(s1 + s2 + s3))

Submission status: Accepted

Solution code:
s = input()
arr_list = list(s)
print(arr_list.count("1"))

Submission status: Accepted

Solution code:
a=[]
a=list(map(int,input()))
print(a.count(1))

Submission status: Accepted

Solution code:
s=list(input())
print(sum([int(i) for i in s]))

Submission status: Accepted

Solution code:
s = input()
count = 0
for i in range(3):
  if s[i] == "1":
    count = count + 1
    
print(count)

Submission status: Accepted

Solution code:
s1, s2, s3 = map(int, input())
print(s1 + s2 + s3)

Submission status: Accepted

Solution code:
s = input().rstrip()

print(s.count('1'))

Submission status: Accepted

Solution code:
s=input()
cnt=0
if s[0]=='1' : cnt+=1
if s[1]=='1' : cnt+=1
if s[2]=='1' : cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
num_str = input()

print(sum([1 for a in num_str if a == '1']))

Submission status: Accepted

Solution code:
s = input()
print( s.count('1') )

Submission status: Accepted

Solution code:
n = int(input())
if n%3 == 0:
    if n == 111:
        print(3)
    else:
        print (0)
elif n%3 ==1:
    print(1)
else:
    print(2)

Submission status: Accepted

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

s = list(input())
s = list(map(int,s))

print(sum(s))

Submission status: Accepted

Solution code:
def solve(string):
    return str(string.count("1"))


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = list(str(input()))
num = [int(s) for s in a]
print(sum(num))

Submission status: Accepted

Solution code:
s = input()
s_list = list(s)
count = 0
for si in s_list:
  if si == "1":
    count += 1
print(count)

Submission status: Accepted

Solution code:
import re

s = input()
print(len(re.findall('1',s)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
arr = list(raw_input())
s = 0
if(arr[0] == "1"):
  s += 1
if(arr[1] == "1"):
  s += 1
if(arr[2] == "1"):
  s += 1
print s

Submission status: Accepted

Solution code:
print(sum(1 for c in input() if c == '1'))

Submission status: Accepted

Solution code:
def count_1(a):
  c=0
  for i in a:
    if i=="1":
      c+=1
  else:
    return c
a=input()
print(count_1(a))

Submission status: Accepted

Solution code:
math=list(input())
print("{}".format(int(math[0])+int(math[1])+int(math[2])))

Submission status: Accepted

Solution code:
number = int(input())
count = 0

for i in range(3):
    count = count + (number % 10)
    number = int(number / 10)

print(count)

Submission status: Accepted

Solution code:
number = input()
count = 0

for i in range(len(number)):
  if number[i] == "1":
  	count += 1

print(count)

Submission status: Accepted

Solution code:
s = input()
count = 0
if s[0] == '1':
  count+=1 
if s[1] == '1':
  count+=1
if s[2] == '1':
  count+=1
  
print(count)

Submission status: Accepted

Solution code:
s=input()
a,b,c=s[0],s[1],s[2]

print(int(a)+int(b)+int(c))

Submission status: Accepted

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

s = list(input())
result = 0
for i in s:
    if i == '1':
        result += 1

print(result)

Submission status: Accepted

Solution code:
s = input()
sum = 0
for i in range(len(s)):
    sum += int(s[i])

print(sum)

Submission status: Accepted

Solution code:
s1_3 = input()
s1, s2, s3 = s1_3[0], s1_3[1], s1_3[2]

y = 0
for x in (s1, s2, s3):
    # print(y)
    if int(x) == 1:
        y += 1

print(y)

Submission status: Accepted

Solution code:
N = input()
a = int(N[0])+int(N[1])+int(N[2])

print(a)

Submission status: Accepted

Solution code:

A=input()
B=A.replace('0','')
c=len(B)
print(c)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007


#A
def A():
    a,b = LI()
    if not (a*b)%2:
        print("Even")
    else:
        print("Odd")
    return

#B
def B():
    s = S()
    print(s.count("1"))
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == "__main__":
    B()

Submission status: Accepted

Solution code:
N = int(input())
print(N%9)

Submission status: Accepted

Solution code:
S = input()
res = 0
for c in S:
  if (c=='1'):
    res+=1
print(res)

Submission status: Accepted

Solution code:
s = input()
print( int(s[0])+int(s[1])+int(s[2]) )

Submission status: Accepted

Solution code:
s = input()
a = list(s)
print(a.count('1'))

Submission status: Accepted

Solution code:
# A
s = str(input())
count = 0
for i in range(3):
    if s[i] == '1':
        count += 1
print(count)

Submission status: Accepted

Solution code:
str = list(input())
c = 0
for s in str:
 c += int(s)
print(c)

Submission status: Accepted

Solution code:
x = [int(i) for i in list(input())]
print(sum(x))

Submission status: Accepted

Solution code:
N = 1
data = []
for i in range(N):
    data_input = list(map(int,input().split()))
    data.append(data_input)
data = data[0][0]
ans=0
for i in range(3):
    k=2-i
    ans += data // (10**k)
    data = data % (10**k)
    
print(ans)

Submission status: Accepted

Solution code:
masu = list(input())
print(masu.count("1"))

Submission status: Accepted

Solution code:
n = int(input())
c = 0
if((n-1)%2==0):
    c+=1
if((n-110)>=0 or ((n-10)>=0 and 100 > n)):
    c+=1
if((n-100)>=0):
    c+=1
print(c)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = input()
ans = 0
for i in range(3):
    if s[i] == '1':
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
print(input().count('1'))

Submission status: Accepted

Solution code:
x = input()
print(int(x[0])+int(x[1])+int(x[2]))

Submission status: Accepted

Solution code:
n = input()
s = []
for i in n:
   s.append(i) 

count = 0
for i in range(0,3):
	if s[i] == "1":
		count += 1
    
print(count)

Submission status: Accepted

Solution code:
s = input()
cnt = 0

if s[0] == "1":
	cnt =cnt + 1

if s[1] == "1":
	cnt +=1
if s[2] == "1":
	cnt +=1

print(cnt)

Submission status: Accepted

Solution code:
abc = map(int, input())
count = 0

for i in abc:
    if int(i) == 1:
        count += 1

print(count)

Submission status: Accepted

Solution code:
inputStr = input()
print(inputStr.count("1"))

Submission status: Accepted

Solution code:
s = input()
cnt = 0
for i in s:
  if(i=='1'):
    cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
s = str(input())
count = 0
for i in range(3):
    if s[i] == '1':
        count += 1
    else:
        continue
print(str(count))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
p = list(input())
count = 0
for i in p:
    if i == '1':
        count += 1
print(count)

Submission status: Accepted

Solution code:
a = list(input())
for i in range(3):
    a[i] = int(a[i])
print(a[0]+a[1]+a[2])

Submission status: Accepted

Solution code:
A=list(input())
print(eval("+".join(A)))

Submission status: Accepted

Solution code:
s=input()
print(sum([s[i]=='1' for i in range(3)]))

Submission status: Accepted

Solution code:
# coding: utf-8
a= input()
b=0
for i in range(3):
  if a[i:i+1] =="1":
    b = b +1
print(b)

Submission status: Accepted

Solution code:
a = list(map(int,input()))
print(sum(a))

Submission status: Accepted

Solution code:
a = str(input())
count = 0 
if a[0] == "1":
  count += 1
if a[1] == "1":
  count += 1
if a[2] == "1":
  count += 1  
print(count)

Submission status: Accepted

Solution code:
s=input();print(int(s[0])+int(s[1])+int(s[2]))

Submission status: Accepted

Solution code:
m=input()
s=[int(i) for i in m]
print(sum(s))

Submission status: Accepted

Solution code:
print(sum(1 if e == '1' else 0 for e in input()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
s_list = list(s)
j = 0
c1 = 0
for i in s_list:
    if int(s_list[j]) == 1:
        c1 += 1
    j += 1
print(c1)

Submission status: Accepted

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

s = input()
count = 0
for i in s:
    if i == '1':
        count += 1
print(count)

Submission status: Accepted

Solution code:
sss = input()
masu = list(sss)
counter = 0
if(masu[0] == '1'):
    counter += 1
if (masu[1] == '1'):
    counter += 1
if (masu[2] == '1'):
    counter += 1
print(counter)

Submission status: Accepted

Solution code:
N = input()
ans = 0

if N[0] == '1':
    ans += 1
if N[1] == '1':
    ans += 1
if N[2] == '1':
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
def placing_marbles(s: str) -> int:
    return sum(c == '1' for c in s)


if __name__ == "__main__":
    s = input()
    ans = placing_marbles(s)
    print(ans)

Submission status: Accepted

Solution code:

s = int(input())
ans = 0
while s > 0:
    ans += s%10
    s //= 10
print(ans)

Submission status: Accepted

Solution code:
s = input()
s1 = int(s[0])
s2 = int(s[1])
s3 = int(s[2])
print("{}".format(s1+s2+s3))

Submission status: Accepted

Solution code:
#83A
s = str(input())
print(s.count('1'))

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    S = [int(s) for s in input().strip()]
    print(sum(S))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

s = input()

cnt = 0

for i in s:
    if i == "1":
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
a = input()
count = a.count("1")
print(count)

Submission status: Accepted

Solution code:
s = input()
s1 = int(s[0])
s2 = int(s[1])
s3 = int(s[2])
print(s1+s2+s3)

Submission status: Accepted

Solution code:
print([i for i in input()].count("1"))

Submission status: Accepted

Solution code:
def main():
    print(sum(map(int, list(input()))))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a = list(input())
count = 0

b = int(a[0])
c = int(a[1])
d = int(a[2])

if b == 1:
    count += 1

if c == 1:
    count += 1

if d == 1:
    count += 1

print(count)

Submission status: Accepted

Solution code:
a = list(input())
b=0
for i in a:
    if i=='1':
        b+=1
print(b)

Submission status: Accepted

Solution code:
s1,s2,s3=map(int, list(input()))
print(s1+s2+s3)

Submission status: Accepted

Solution code:
a = str(input())
count = 0
if a[0] == '1':
    count = count + 1
if a[1] == '1':
    count = count + 1
if a[2] == '1':
    count = count + 1
print(count)

Submission status: Accepted

Solution code:
s = input()
c = 0
if s[0] == "1": c += 1
if s[1] == "1": c += 1
if s[2] == "1": c += 1
print(c)

Submission status: Accepted

Solution code:
# inputでコマンド入力の数字を取得し、listに渡して一文字ずつ配列に格納
# inputで取得された数字はすべて文字列型で格納されているので、intで数値に変換
binDigit = [int(num) for num in list(input())]

# 配列の合計を計算。各配列要素の１の個数＝各配列の合計値
sumNum = sum(binDigit)

print(sumNum)

Submission status: Accepted

Solution code:
ans = 0
for i in input():
  if i == "1": 
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
def main():
    s = input()
    ans = 0
    for c in s:
        if c == '1':
            ans += 1
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()

count = 0
for sn in s:
	if sn == '1':
		count += 1
		
print(count)

Submission status: Accepted

Solution code:
from sys import stdin

s = stdin.readline().rstrip()
print(s.count("1"))

Submission status: Accepted

Solution code:
#abc081a
s=list(input())
print(int(s[0])+int(s[1])+int(s[2]))

Submission status: Accepted

Solution code:
L = input()
n=0
for i in range(len(L)):
    if int(L[i]) ==1:
        n += 1
print(n)

Submission status: Accepted

Solution code:
s = list(input())
count = 0

for i in range(3):
  if(s[i] == '1'):
    count += 1
print(count)

Submission status: Accepted

Solution code:
masu = input()
print(str(len(str(masu).replace("0",""))))

Submission status: Accepted

Solution code:
masu = input()
mas1 = str(masu).replace("0","")
print(str(len(mas1)))

Submission status: Accepted

Solution code:
num_list = input()
cnt = 0
for i in num_list:
	if i == '1':
		cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
i = input()
print(int(i[0] == '1') + int(i[1] == '1') + int(i[2] == '1'))

Submission status: Accepted

Solution code:
s=input()
a=[int(x) for x in s]
print(sum(a))

Submission status: Accepted

Solution code:
n=list(input())
print(n.count("1"))

Submission status: Accepted

Solution code:
# coding: utf-8
S = input()
ans = 0
for s in S:
  if s == '1':
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin

a = stdin.readline().rstrip()
print(a.count('1'))

Submission status: Accepted

Solution code:
masu = list(input())
balls = masu.count('1')
print(balls)

Submission status: Accepted

Solution code:
l=list(map(int,str(input())))
print(l.count(1))

Submission status: Accepted

Solution code:
s=input() 
print(s.count("1"))

Submission status: Accepted

Solution code:
s = raw_input()
ans =0
for c in s:
    if c =="1":
        ans+=1
print ans

Submission status: Accepted

Solution code:
data = int(input())
count = 0;
if data>=100:
    count += 1
if data%10==1:
    count += 1
if data%100>=10:
    count += 1
print(count)

Submission status: Accepted

Solution code:
s=input()
t=0
for i in range(0,3):
  if s[i]=='1':
    t=t+1
print(t)

Submission status: Accepted

Solution code:
s = input()
count = 0

for i in s:
    if(i == "1"):
        count += 1

print(count)

Submission status: Accepted

Solution code:
from sys import stdin
l = list(stdin.readline().rstrip())
print(l.count('1'))

Submission status: Accepted

Solution code:
S=input()
ans=0
for s in S:
  if s=='1':
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
from collections import Counter

s = input()
cnt = Counter(s)
print(cnt['1'])

Submission status: Accepted

Solution code:
s = input()

ans = 0
for i in s:
    if i == '1': ans += 1

print( ans )

Submission status: Accepted

Solution code:
s = input()
ans = 0
for x in s:
    if x == "1":
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
a = int(input())
b = 0
for i in range(3):
    if a % 2 == 0:
        a = a / 10
    else:
        b = b + 1
        a = (a-1)/10
print(b)

Submission status: Accepted

Solution code:
num = str(input())

L = list(num)

ans = L.count('1')
print(ans)

Submission status: Accepted

Solution code:
math=input()
a_list=list(math+'0')
a_list.remove('0')
ball=a_list.count('1')
print(ball)

Submission status: Accepted

Solution code:
a = str(input())
b = int(a[0]) == 1
c = int(a[1]) == 1
d = int(a[2]) == 1

print(b+c+d)

Submission status: Accepted

Solution code:
s = str(input().split())


print(s.count('1'))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Feb 24 22:36:54 2019

@author: yuta
"""

def match(s):
    count = 0
    for i in s:
        if i == '1':
            count += 1
    print(count)    

x = input()
match(x)    
"""    
    count = 0
    for i in "Hello":
        if i == 'l':
            count = count + 1
    print(count)
"""

Submission status: Accepted

Solution code:
ss = input()

ans = ss.count('1')

print(ans)
print()

Submission status: Accepted

Solution code:
s=list(map(int,list(input())))
 
print(sum(s))

Submission status: Accepted

Solution code:
s = input()
count = 0
for i in s:
    if i == '1':
        count += 1
print(count)

Submission status: Accepted

Solution code:
s1s2s3 = input()
counter = 0
for i in s1s2s3:
    if i == '1':
        counter += 1
print(counter)

Submission status: Accepted

Solution code:
str_lis = list(input())
s = sum([int(x) for x in str_lis])
print(s)

Submission status: Accepted

Solution code:
a=str(input())
b=list(a)
print(b.count("1"))

Submission status: Accepted

Solution code:
s = input()
count = 0

for i in range(3):
    if s[i] == "1":
        count += 1

print(count)

Submission status: Accepted

Solution code:
s = str(input())
separated = list(s)
count = 0
for char in separated:
    if char == "1":
        count += 1
print(count)

Submission status: Accepted

Solution code:
char_list = list(input())
num_list = list(map(int, char_list))
out = sum(num_list)
print(out)

Submission status: Accepted

Solution code:
import math
import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

s = S()

print(s.count("1"))

Submission status: Accepted

Solution code:
s = input()
n=0
for x in s:
    if(x == "1"):
        n=n+1
print(n)

Submission status: Accepted

Solution code:
print raw_input().count("1")

Submission status: Accepted

Solution code:
a,b,c = input()
count = 0
if a == "1":
  count += 1
if b == "1":
  count += 1
if c == "1":
  count += 1
print(count)

Submission status: Accepted

Solution code:
s = input()
count = 0
for i in range(3):
    if s[i] =='1':
        count += 1
print(count)

Submission status: Accepted

Solution code:
import sys
A = map(int, list(sys.stdin.readline().rstrip()))
ans = 0
for i in xrange(len(A)): ans += A[i]
print ans

Submission status: Accepted

Solution code:
binary = list(input())
print(binary.count("1"))

Submission status: Accepted

Solution code:
a = input()
cnt=0

if a[0] ==str(1): 
    cnt+=1
if a[1] ==str(1):
    cnt+=1
if a[2] ==str(1):
    cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
masume = input().split()[0]
masume = [int(x) for x in list(masume)]

one_n = len([x for x in masume if x == 1])
print(one_n)

Submission status: Accepted

Solution code:
print(list(map(int,input())).count(1))

Submission status: Accepted

Solution code:
shio = str(raw_input())
counter = 0
i=0
while i < 3:
  if shio[i] == "1":
    counter +=1
  i +=1
print(counter)

Submission status: Accepted

Solution code:
abc = input()
abc = str(abc)
print(abc.count("1"))

Submission status: Accepted

Solution code:
s = input()
count = 0
if s[0] =="1":
  count += 1
if s[1] =="1":
  count += 1
if s[2] =="1":
  count += 1
print(count)

Submission status: Accepted

Solution code:
hoge=input()
print(hoge.count("1"))

Submission status: Accepted

Solution code:
s=input()
ans=s.count('1')
print(ans)

Submission status: Accepted

Solution code:
s = input()
s.count('1')
print(s.count('1'))

Submission status: Accepted

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

s = str(input())

cnt = 0
for c in s:
    if c == '1':
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
s = input()
ans = s.count("1")
print(ans)

Submission status: Accepted

Solution code:
s = input()

count = 0
for i in range(3):
    if s[i] == '1':
        count += 1
print(count)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    s = input()
    print(sum(map(int, s)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = (input())
b = int(a[0]) + int(a[1]) + int(a[2])

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

Submission status: Accepted

Solution code:
in_str = input()

print(in_str.count('1'))

Submission status: Accepted

Solution code:
a=str(input())
b=0
for moji in a:
    if moji=="1":
        b+=1

print(b)

Submission status: Accepted

Solution code:
s1s2s3=input()
print(s1s2s3.count("1"))

Submission status: Accepted

Solution code:
a = input()
b= 0
for i in a:
    if i == "1":
        b += 1
print(b)

Submission status: Accepted

Solution code:
def count(lst, x):
   ctr = 0
   for i in lst:
      if i == x:
         ctr += 1
   return ctr

s = [x for x in input()]
print(count(s, "1"))

Submission status: Accepted

Solution code:
s = input()
sum = 0
for i in range(len(s)):
    if s[i] == "1":
        sum += 1
print(str(sum))

Submission status: Accepted

Solution code:
s = str(input())
print(s.count('1'))

Submission status: Accepted

Solution code:
a = [int(n) for n in list(input())]
count = 0
for i in a:
    if i == 1:
        count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
ans = 0
for c in S:
    if c == "1":
        ans += 1
print(ans)