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.

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

Solution (Python):
print(input().count("1"))

Solution (Python):
a,b, c = map(int, list(input()))
print(a+b+c)

Solution (Python):
print(input().count("1"))

Solution (Python):
s = input()

ans = s.count('1')

print(ans)

Solution (Python):
print(input().count("1"))

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

Solution (Python):

 
a = input()
b = 0
for i in range(3): 
    if a[i] =='1':
        b += 1
print(str(b))

Solution (Python):
print(input().count("1"))

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

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

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

Solution (Python):
s = str(input())
a = int(s[0])*1
a = a+int(s[1])*1
a = a+int(s[2])*1
print(a)

Solution (Python):
print(input().count("1"))

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

Solution (Python):
print(input().count("1"))

Solution (Python):
s = input()

print(s.count("1"))

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

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

Solution (Python):
a = int(input())
count = 0
for i in range (len(str(a))):
  if str(a)[i] == '1':
    count += 1
  else:
    pass
print(count)

Solution (Python):
print(input().count("1"))

Solution (Python):
s = input()

counter = 0
if s[0] == '1':
    counter += 1
if s[1] == '1':
    counter += 1
if s[2] == '1':
    counter += 1

print(counter)

Solution (Python):
Marbles=[int(char1) for char1 in input()]
print(sum(Marbles))

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

Solution (Python):
s=int(input())
a=[i for i in str(s)]
print(a.count("1"))

Solution (Python):
a = int(input())
print(a%9)

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

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

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

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

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

Solution (Python):
li = list(map(int, input()))
count = 0
for i in range(len(li)):
  count += li[i]
print(count)

Solution (Python):
print(input().count("1"))

Solution (Python):
s = input()

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

print(cnt)

Solution (Python):
import collections
print(collections.Counter(input())["1"])

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

a = 0
for x in range(len(int)):
  if int[x] == "1":
    a +=1
   
print(a)

Solution (Python):
n = list(input())
a = 0
for i in range(3):
    if n[i] == "1":
        a += 1
print(a)

Solution (Python):
n = input()
b = 0
for i in range(3):
  if n[i] == "1":
    b += 1
print(b)

Solution (Python):
print(input().count("1"))

Solution (Python):
s = input()

print(s.count("1"))

Solution (Python):
s = list(input())
 
a = 0
 
if s[0] == "1":
  a = a + 1
 
if s[1] == "1":
  a = a + 1
 
if s[2] == "1":
  a = a + 1
  
print(a)

Solution (Python):
z = input()
cnt = 0
for i in range(len(z)):
  if(int(z[i])==1):
    cnt = cnt + 1
print(cnt)

Solution (Python):


def main():
    unko = raw_input()
    unko_ans = 0
    for i in range(3):
        if unko[i] == '1':
            unko_ans = unko_ans + 1
    print(unko_ans)
if __name__ == "__main__":
    main()

Solution (Python):
import sys
import collections

def m0():
    args = sys.stdin.read().split()
    s = args[0]
    cnt = list(s).count('1')
    print(cnt)

def m1():
    args = sys.stdin.read().split()
    s = args[0]
    counter = collections.Counter(list(s))
    print(counter['1'])

if __name__ == "__main__":
    m1()

Solution (Python):


import numpy as np

s=input()
ans=s.count("1")
print(ans)

Solution (Python):
import sys
import collections

def m0():
    args = sys.stdin.read().split()
    s = args[0]
    cnt = list(s).count('1')
    print(cnt)

def m1():
    args = sys.stdin.read().split()
    s = args[0]
    counter = collections.Counter(list(s))
    print(counter['1'])

if __name__ == "__main__":
    m1()

Solution (Python):

"""AtCoder Beginner Contest 081: A - Placing Marbles
https://atcoder.jp/contests/abc081/tasks/abc081_a
"""

__author__ = 'bugttle <bugttle@gmail.com>'


def main():
    s = input()
    print(s.count('1'))


if __name__ == '__main__':
    main()

Solution (Python):
s_input = str(input())
 
s_1 = s_input[0:1]
s_2 = s_input[1:2]
s_3 = s_input[2:3]
 
count = 0
 
s_list = [s_1, s_2, s_3]
 
for s in s_list:
    if s == "1":
        count = count + 1
    else:
        None
      
print(count)

Solution (Python):
print(input().count("1"))

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

Solution (Python):
print(input().count('1'))

Solution (Python):
print(sum([int(i) for i in input()]))

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    s = input()
    print(s.count("1"))
    return


if __name__ == "__main__":
    solve()

Solution (Python):
num = input()
i = 0
sum = 0
while i <= len(num)-1:
  sum += int(num[i])
  i += 1

print(sum)

Solution (Python):
a=input()

print(a.count("1"))

Solution (Python):
print(input().count('1'))

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

count = 0

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

print(count)

Solution (Python):
Si = input()
S1 = int(Si[0])
S2 = int(Si[1])
S3 = int(Si[2])
n = 0
if S1:
  n += 1
if S2:
  n += 1
if S3:
  n += 1
print(n)

Solution (Python):
s = input()


sum = 0


for i in range(len(s)):
    if s[i] == '1':
        sum += 1

print(sum)

Solution (Python):
s = input()
l = [int(x) for x in s]
print(l.count(1))

Solution (Python):
block = input()
num = 0
for i in range(len(block)):
	if block[i] == "1":
		num += 1
print(num)

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

    S = S.replace("0","")

    print(len(S))

if __name__ == '__main__':
    main()

Solution (Python):
d = input()

num = 0

if d[0] == "1":
  num += 1
if d[1] == "1":
  num += 1
if d[2] == "1":
  num += 1
  
print(num)

Solution (Python):
print(input().count("1"))

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

Solution (Python):
print(int(input())%9)

Solution (Python):
print(sum([int(i) for i in input()]))

Solution (Python):
x = input()
y = 0
for i in x:
    y += int(i)
print(y)

Solution (Python):
print(input().count('1'))

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

Solution (Python):
input = input()

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

Solution (Python):
s = input()
ans = 0
for i in s:
    ans += int(i)
print(ans)

Solution (Python):
num = input()

n = num.count('1')
print(n)

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

Solution (Python):
print(input().count("1"))

Solution (Python):
s = input()

cnt = 0

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

print(cnt)

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

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

Solution (Python):
a = input()
b = int(a)

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

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

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

N=0

for i in a:
    if int(i)==1:
        N+=1
        
print(N)

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

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

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

Solution (Python):
import sys
from collections import Counter
def counter(li, n):
    count = Counter()
    count.update(li)
    return count[n]
input = sys.stdin.readline
li = input().strip()
print(counter(li, "1"))

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

Solution (Python):
print(input().count("1"))

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): 
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): 
    return a/gcd(a,b)*b

def divisors(a): 
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

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

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

Solution (Python):
import numpy as np

s = input()
ss = [int(i) for i in s]
print(np.sum(ss))

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

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

Solution (Python):
ss = input()

count = 0
for i in ss:
  if i == '1':
    count+=1

print(count)

Solution (Python):

m = input()


cnt = 0
for i in range(3):
    if m[i] == "1":
        cnt += 1


print(cnt)

Solution (Python):
s = input()

print(s.count('1'))

Solution (Python):
print(input().count("1"))

Solution (Python):
a, b, c=map(int,list(input()))
print(a+b+c)

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

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

print(count)

Solution (Python):


s = input()
a = [int(c) for c in s]
print (a[0]+a[1]+a[2])

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

Solution (Python):


s = input()

print(s.count('1'))

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

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

print(count)

Solution (Python):
x = input()
count = 0
for x in x:
    if x == '1': count += 1
print(count)

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

Solution (Python):
n = input()
square = []
square.append(int(n[0]))
square.append(int(n[1]))
square.append(int(n[2]))
ans = 0
for i in range(0, 3):
    if square[i] == 1:
        ans += 1
print(ans)

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

print(N.count("1"))

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

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

Solution (Python):


a = input()

print(int(a[0]) + int(a[1]) + int(a[2]))

Solution (Python):
print(int(input())%9)

Solution (Python):
print(input().count("1"))

Solution (Python):
print(len(list(filter(lambda s: s == '1', list(input())))))

Solution (Python):
print(input().count('1'))

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

Solution (Python):
a, b, c = input()
a = int(a)
b = int(b)
c = int(c)
i = 0 
if a == 1:
    i += 1
    if b == 1:
        i += 1
        if c == 1:
            i += 1
            print(i)
        else:
            print(i)
    else:
        if c == 1:
            i += 1
            print(i)
        else:
            print(i)
else:
    if b == 1:
        i += 1
        if c == 1:
            i += 1
            print(i)
        else:
            print(i)
    else:
        if c == 1:
            i += 1
            print(i)
        else:
            print(i)

Solution (Python):
s = input()
a = [int(c) for c in s]
total = sum(a)
print(total)

Solution (Python):

number = input()

n_one = 0
for n in range(3):
    if int(str(number)[n]) == 1:
        n_one += 1

print(n_one)

Solution (Python):

number = input()

n_one = 0
for n in range(3):
    if int(str(number)[n]) == 1:
        n_one += 1

print(n_one)

Solution (Python):
n=input()

print(n.count("1"))

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

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

Solution (Python):
import sys
input = sys.stdin.readline
s = input()
cnt = 0
for i in s:
    if i == "1":
        cnt += 1
print(cnt)

Solution (Python):
s = input()

s_list = [int(s[0]), int(s[1]), int(s[2])]

count = 0
for i in s_list:
  if i == 1:
    count += 1
    
print(count)

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

Solution (Python):
print(input().count('1'))

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

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

Solution (Python):
s = list(input())
f = lambda x:1 if x=='1' else 0
y = list(map(f, s))
print(sum(y))

Solution (Python):
print(input().count("1"))

Solution (Python):
s=[i for i in input()]
print(s.count("1"))

Solution (Python):
s = input()

print(s.count("1"))

Solution (Python):
x=int(input())

s1=x//100
s2=x//10%10
s3=x%10

print(s1+s2+s3)

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

Solution (Python):
print(input().count('1'))

Solution (Python):
a = input()
cnt=0

for i in a:
    if int(i) == 1 :
        cnt+=1
    
print(cnt)

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

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

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

Solution (Python):
import sys

num = input()

count = 0
for i in num:
    if int(i) == 1:
        count += 1
print(count)

Solution (Python):
a = str(input())
print(a.count('1'))

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

Solution (Python):



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

Solution (Python):
def main():
  s = input()
  c = 0
  for i in s:
    c += int(i)
  print(c)

if __name__ == "__main__":
  main()

Solution (Python):
def main():
    s = list(input())
    print(s.count('1'))

if __name__ == '__main__':
    main()

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

Solution (Python):




str = input()
print (str.count('1'))

Solution (Python):




str = input()
print (str.count('1'))

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

Solution (Python):
def validation(i):

    if i == 0 or i == 1:
        return i

    else:
        return 0

square = map(validation, [int(i) for i in input().strip()])

print(list(square).count(1))

Solution (Python):
num = input()
print(num.count('1'))

Solution (Python):

import sys


def main(argv=sys.argv):
  list1 = list(input()) 
  print(list1.count('1'))
  
  return 0


if __name__ == '__main__':
  sys.exit(main())

Solution (Python):

import sys


def main(argv=sys.argv):

    print(sum(map(int, list(input()))))

    return 0


if __name__ == '__main__':
    sys.exit(main())

Solution (Python):
li = list(input())
count = 0

for i in li:
  if i == '1':
    count += 1

print(count)

Solution (Python):
s = int(input())
l = []
while s > 0:
	l.append(s%10)
	s //= 10

print(l.count(1))

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

Solution (Python):
n = input()
print(n.count('1'))

Solution (Python):
S = list(input())
print(S.count("1"))

Solution (Python):
import sys

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

def main():
    return s.count('1')

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

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

Solution (Python):
print(input().count("1"))

Solution (Python):

s1s2s3=str(input())

b=0

for i in s1s2s3:
    b=b+int(i)

print(b)

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

Solution (Python):
print(input().count('1'))

Solution (Python):
print(input().count('1'))

Solution (Python):
s = input()

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

print(count)

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

Solution (Python):
x = None
s = list([x, x, x])
result = 0
s[0], s[1], s[2] = map(int, input()) 
for i in range(len(s)):
    if s[i] == 1:
        result += 1
print(result)

Solution (Python):
s = input()
print('{}'.format(sum([int(i) for i in s])))

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

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

Solution (Python):
a = list(input().rstrip())
print(a.count('1'))

Solution (Python):
print(input().count("1"))

Solution (Python):
be = str(input())
lst = list(be)
count = 0
for i in range (3):
	if lst[i] == "1":
		count += 1
print(count)

Solution (Python):
print(input().count("1"))

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

Solution (Python):
print(input().count("1"))

Solution (Python):
ls=input()
i=0
for x in ls:
    if x=='1':
        i+=1

print(i)

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

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

count = 0
for i in line:
    if i == "1":
        count += 1
        
print(count)

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

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

Solution (Python):
s = input()

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

print(ans)

Solution (Python):
print(input().count("1"))

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

print(s.count('1'))

Solution (Python):
import math

n = input()
print(n.count("1"))

Solution (Python):
S = input()
print(S.count("1"))

Solution (Python):




def solver(str):
    result = 0
    if str[0] == '1':
        result = result + 1
    if str[1] == '1':
        result = result + 1
    if str[2] == '1':
        result = result + 1

    return result


if __name__ == "__main__":
    result = 0
    result = solver(input())
    print(result)

Solution (Python):
S = list(input())
print(S.count("1"))

Solution (Python):
print(input().count("1"))

Solution (Python):
print(input().count("1"))

Solution (Python):
s = input()

ans = 0

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

print(ans)

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

Solution (Python):
print(input().count("1"))

Solution (Python):
print(str(input()).count("1"))

Solution (Python):
print(list(str(input())).count("1"))

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

Solution (Python):
i = input()
cnt = 0
for j in range(3):
	if(int(i[j])==1):
		cnt+=1
print(cnt)

Solution (Python):
[ s1, s2, s3 ] = str( input() )
print( int( s1 ) + int( s2 ) + int( s3 ) )

Solution (Python):
a=input()

print(a.count("1"))

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

Solution (Python):
if __name__=="__main__":
  a=input()
  print(a.count('1'))

Solution (Python):
x = input() 
a = list(x) 
a  = [int(s) for s in x] 
b = 0 
for i in range(3):
     if a[i] == 1:
         b += 1
print(b)

Solution (Python):
sample=input()
one_count=0
s=0
for i in sample:
  if sample[s] == "1":
    one_count+=1
    s+=1
  else:
    s+=1  
    
print(one_count)

Solution (Python):

str_list = input()

cnt = 0

for str in str_list:
    if str == '1':
        cnt += 1

print(cnt)

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

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

print(sum(map(int, list(input()))))

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

Solution (Python):
li = list(input())
print(int(li[0]) + int(li[1]) + int(li[2]))

Solution (Python):
li = list(input())
print(int(li[0]) + int(li[1]) + int(li[2]))

Solution (Python):
li = list(input())
counter = int(li[0]) + int(li[1]) + int(li[2])
print(counter)

Solution (Python):
li = list(input())
counter = 0
for i in li:
   counter += int(i)
print(counter)

Solution (Python):
num = input()
counter = 0
li = list(num)
if li[0] == "1":
    counter += 1
if li[1] == "1":
    counter += 1
if li[2] == "1":
    counter += 1
print(counter)

Solution (Python):
a, b, c = map(int, input())
count =0

if a == 1:
    count+=1

if b == 1:
    count+=1

if c == 1:
    count+=1

print(count)

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

Solution (Python):
s=input()
i=0
for x in s:
    if int(x)==1:
        i+=1
print(i)

Solution (Python):
print(input().count('1'))

Solution (Python):
print(input().count('1'))

Solution (Python):

s = input()
s = map(int,[s[0], s[1], s[2]]) 
bedama = 0
for masu in s:
  if masu == 1:
    bedama += 1
print(bedama)

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

Solution (Python):
print(input().count('1'))

Solution (Python):
print(input().count('1'))

Solution (Python):




def solver(marble):
    result = 0
    n = marble
    while 0 < n:
        scaleNo = n % 10
        result = result + scaleNo
        n = n // 10
    return result


if __name__ == "__main__":
    answer = 0
    answer = solver(int(input()))
    print(answer)

Solution (Python):
print(input().count("1"))

Solution (Python):
S = input()

ans = 0;

for i in range(len(S)):
    if S[i] == '1':
        ans = ans + 1

print(ans)

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

Solution (Python):
print(input().count('1'))

Solution (Python):
n = input()
ans = n.count('1')
print(ans)

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

Solution (Python):
s = input()
factor = [int(x) for x in s]
print(sum(factor))

Solution (Python):
s = list(map(str, input()))
print(s.count('1'))

Solution (Python):
s = list(input())
a = 0
for i in s:
    if i == "0":
        continue
    else:
        a +=1
print(a)

Solution (Python):
print(input().count('1'))

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

print(s.count('1'))

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

Solution (Python):

import sys, math, itertools, heapq, collections, bisect, string
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**7)
inf = float('inf')
mod = 10**9+7
ans = inf ;count = 0 ;pro = 1

S=input()
C=collections.Counter(S)
print(C["1"])

Solution (Python):
print(sum(list(map(int,str(input())))))

Solution (Python):
print(sum(list(map(int,str(input())))))

Solution (Python):
N = input()
print(N.count("1"))

Solution (Python):


def solve(s: str):
    print(s.count("1"))



def main():
    s = input()
    solve(str(s))

if __name__ == '__main__':
    main()

Solution (Python):

bits = input()
cnt = 0
for bit in bits:
  cnt += int(bit)
  
  
print(cnt)

Solution (Python):
s=input()
count=0
i=0
while i<3:
	if s[i]=="1":
		count+=1
	i+=1
print(count)

Solution (Python):
s = input()

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

print(sum)

Solution (Python):
print(input().count("1"))

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

Solution (Python):
print(input().count("1"))

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

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

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

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

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

Solution (Python):




def onecounter(input_square):
    result = 0
    if input_square[0] == '1':
        result = result + 1
    if input_square[1] == '1':
        result = result + 1
    if input_square[2] == '1':
        result = result + 1
    return result


if __name__ == "__main__":
    answer = onecounter(input())
    print(answer)
exit

Solution (Python):
print(input().count("1"))

Solution (Python):
s=input()
result=0

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

Solution (Python):
s = input()

print(s.count('1'))

Solution (Python):
print(str(input()).count("1"))

Solution (Python):
print(input().count('1'))

Solution (Python):
print(list(input()).count("1"))

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

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

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

Solution (Python):
print(input().count('1'))

Solution (Python):
print(input().count('1'))

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

print(count)

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

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

result = 0

for str_num in str_numbers:
    if str_num == '1':
        result+=1

print(result)

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

num=MarbleList.count('1')
print(num)

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

Solution (Python):
print(input().count("1"))

Solution (Python):
print(input().count("1"))

Solution (Python):
print(int(input())%9)

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

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

Solution (Python):
l=[int(i) for i in input()]
print(sum(l))

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

Solution (Python):
print(sum(list(map(int,input()))))

Solution (Python):
a = input()
a_list = list(a)
print(a_list.count("1"))

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

Solution (Python):
print(sum(map(int, input())))

Solution (Python):




n = list(input())

cnt =0
for i in range(3):
    if n[i]=="1":
        cnt += 1

print(cnt)

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

Solution (Python):
input = input()
count = 0

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

Solution (Python):
str = input()
count = 0
for char in str:
  if char == '1':
    count += 1

print(count)

Solution (Python):

values = list(map(int, input()))
cnt = 0
for value in values:
  if value == 1:
    cnt += 1

print(cnt)

Solution (Python):
print(input().count('1'))

Solution (Python):
print(input().count("1"))

Solution (Python):
num = input()
count = 0
for i in num:
	if i == "1":
		count += 1
	else:
		pass
print(count)

Solution (Python):
num = input()
cnt = 0
for i in num:
    if i == "1":
        cnt += 1
print(cnt)

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

print(sl.count("1"))

Solution (Python):
s =   input() 
s1,s2,s3 = int(s[0]),int(s[1]),int(s[2])

print(s1+s2+s3)

Solution (Python):
n = int(input())
s = 0

if int(n/100) == 1:
    s += 1
if n%100 >= 10:
    s += 1
if n%10 == 1:
    s += 1

print(s)

Solution (Python):
str = input().split()
print(str[0].count("1"))

Solution (Python):
s = input()

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

Solution (Python):


import numpy
import scipy

s = input()

print(int(s[0])+int(s[1])+int(s[2]))

Solution (Python):

s=list(input().split())
total=0

for digit in str(s):
 if digit=='1':
        total += 1

print(total)

Solution (Python):
print(input().count('1'))

Solution (Python):
s = input()
ans = 0
for i in s:
    if i == '1':
        ans += 1

print(ans)

Solution (Python):
print(input().count("1"))

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

Solution (Python):
print(input().count('1'))

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

Solution (Python):
print(sum(map(int, list(input()))))

Solution (Python):


str = input()
print(str.count("1") )

Solution (Python):
print(input().count("1"))

Solution (Python):
S=input()
print(S.count("1"))

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

Solution (Python):


S=list(map(int,list(input())))
print(sum(S))

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

Solution (Python):
print(input().count("1"))

Solution (Python):
print(input().count("1"))

Solution (Python):
s = input()

print(s.count("1"))

Solution (Python):
a = input()
print(a.count('1'))

Solution (Python):
S = input()

cout = 0
for i in range(0,len(S)):
    if S[i] == '1':
        cout += 1

print(cout)

Solution (Python):
N=input()
s=0
for i in N:
  if i=="1":
    s=s+1

print(s)

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

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

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

Solution (Python):
s = input()
print(len(s.replace("0","")))

Solution (Python):
num = input()
count = [1 for i in range(len(num)) if num[i] =="1"]
print(len(count))

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

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

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

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

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

print(ans)