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()
print(s.count('1'))

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

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

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

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

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

Solution (Python):




from fractions import gcd
import math
from math import ceil,floor
import collections








S=input()



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

print(ans)

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

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

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

Solution (Python):
s = list(input())
ball = 0
for i in s:
    ball = ball + int(i)

print(ball)

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

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

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

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

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

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

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

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

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



x = s.count("1")

print(x)

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

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

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

print(S.count('1'))

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

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

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

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

Solution (Python):
a,b,c = map(int,input())
total = sum([a,b,c])
print(total)

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

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

Solution (Python):
import sys
st = input()
a = 0
for n in range(3):
    if st[n] == '1':
        a = a + 1
print(a)

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

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

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

Solution (Python):


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

print(c)

Solution (Python):
a = input()

count = 0
for i in a:
    if i == "1":
        count += 1

print(count)

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

count = 0

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

Solution (Python):

s = input()

print(s.count('1'))

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

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

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

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

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

Solution (Python):
word = list(input())
ans = 0
for a in word :
    if a == "1" :
        ans += 1
print(ans)

Solution (Python):
word = list(input())
count = 0
for a in word :
    if a == "1" :
        count = count + 1
print(count)

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

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

Solution (Python):
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()

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

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

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

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

print(a)

Solution (Python):
a = list(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)

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

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

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

cnt = 0

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

print(cnt)

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

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

print(count)

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

print(s)

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

b_int = [int(n) for n in b]

temp = 0

for n in b_int:
    if n%2:
        temp += 1

print(temp)

Solution (Python):
str=input()
a=int(list(str)[0])
b=int(list(str)[1])
c=int(list(str)[2])
print(a+b+c)

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

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

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

Solution (Python):
S = str(input())
one = '1'
if one in S:
  x = S.count('1')
  print(x)
else:
  print(0)

Solution (Python):
a = input()
c = [int(c) for c in a]

print(c.count(1))

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

Solution (Python):

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

print(str(read()).count('1'))

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

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

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

Solution (Python):

print(int(input())%9)

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

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

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

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

Solution (Python):
numbers = list(input())
count = 0
for s in numbers:
    a = int(s)
    if a == 1:
        count +=1
print(count)

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

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

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

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

print(count)

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):
s=str(input())
count=0
for i in range(3):
    if s[i]=='1':
        count+=1
print(count)

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

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

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

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

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

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

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

Solution (Python):
s1, s2, s3 = map(int, input())
s = s1 + s2 + s3
if s == 3:
    print(3)
elif s == 2:
    print(2)
elif s == 1:
    print(1)
else:
    print(0)

Solution (Python):
s1,s2,s3=map(int,input())
s=s1+s2+s3
if s==3:
    print(3)
elif s==2:
    print(2)
elif s==1:
    print(1)
else:
    print(0)

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

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

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

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

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

print(cnt)

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

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

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

Solution (Python):
initStr = input()

number = list(initStr).count('1')

print(number)

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

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

print(b)

Solution (Python):
s1,s2,s3 = map(int, input())

s = s1 + s2 + s3

print(s)

Solution (Python):
s = list(map(int, input()))

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

Solution (Python):

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

Solution (Python):

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

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

for i in s:
    if int(i) == 1:
        n+=1

print(n)

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

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

print(n)

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):
s = input()
print(s.count("1"))

Solution (Python):

"""
Created on Thu May 14 01:17:53 2020

@author: shinba
"""

s = input()

print(s.count("1"))

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

Solution (Python):
a = input()

result =0

if a[0]=="1":
	result +=1
if a[1]=="1":
	result +=1
if a[2]=="1":
	result +=1
    
print(result)

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

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

Solution (Python):
from collections import Counter
s = input()
count = Counter(s)
print(count["1"])

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

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

ONE = a.count('1')

if ONE ==0:
  print(0)
elif ONE ==1:
  print(1)
elif ONE == 2:
  print(2)
elif ONE == 3:
  print(3)

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

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

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

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


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





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

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

Solution (Python):
s = input()

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

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


def isContain(list):
    count = 0
    if list[0] == '1':
        count += 1
    if list[1] == '1':
        count += 1
    if list[2] == '1':
        count += 1
    print(count)


isContain(s)

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys
import math
import bisect

def main():
    ans = 0
    for c in input():
        if c == '1':
            ans += 1
    print(ans)
    
if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
s = input()

count = 0
for c in s:
    if c == "1":
        count += 1

print(count)

Solution (Python):
s = input()

ans = 0

ans += int(s[0])
ans += int(s[1])
ans += int(s[2])

print(ans)

Solution (Python):
s = str(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):
s = input()
goukei = 0
for i in range(3):
    if int(s[i]) == 1:
        goukei += 1

print(goukei)

Solution (Python):
n=input()
i=0
if n[0]=='1':
  i+=1
if n[1]=='1':
  i+=1
if n[2]=='1':
  i+=1
print(i)

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

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

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

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

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

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

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):
print(input().count("1"))

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

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

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

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

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

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

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

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

Solution (Python):
s1,s2,s3=input()
ss1=int(s1)
ss2=int(s2)
ss3=int(s3)

print(ss1+ss2+ss3)

Solution (Python):
from re import findall
print(len(findall(r'1', input())))

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

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

Solution (Python):
S=raw_input()
ans=0
for x in S:
    if x=="1":
        ans+=1
print ans

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

result = int(s[0]) + int(s[1]) + int(s[2])

print(result)

Solution (Python):
s1, s2, s3 = input()
masu = [s1, s2, s3]
print(masu.count('1'))

Solution (Python):
print(input().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=str(input())
c=0
for i in range(0,3):
    if s[i]=="1":
        c+=1

print(c)

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

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

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

Solution (Python):
def ABC_81_A():
    N = input()
    
    print(N.count('1'))

if __name__ == '__main__':

    ABC_81_A()

Solution (Python):
l = input()
 
b = 0
 
for i in l[0], l[1], l[2]:
  if (int(i) == 1):
    b = b+1
 
print(b)

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

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

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

Solution (Python):
l = input()

b = 0

for i in l[0], l[1], l[2]:
  if (int(i) == 1):
    b = b+1

print(b)

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

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

if __name__ == '__main__':
    main()

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

print(count)

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

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()
cnt = 0
for si in s:
    if si == "1":
        cnt += 1
print(cnt)

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

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

Solution (Python):
def main():
    s = int(input())
    s123 = [(s//100), ((s%100)//10), (s%10)]
    cnt = 0
    for n in s123:
        cnt += 1 if n==1 else 0
    print(cnt)

if __name__ == '__main__':
    main()

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

Solution (Python):

import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

print(Counter(rs())['1'])

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

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

Solution (Python):
a = str(input())
b = 0

if a[0] == '1':
    b += 1
if a[1] == '1':
    b += 1
if a[2] == '1':
    b += 1
print(b)

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

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

if __name__ == '__main__':
    main()

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

Solution (Python):
args = str(input().split())
a = int(args[2])
b = int(args[3])
c = int(args[4])
print(a+b+c)

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

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

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

if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

Solution (Python):
s=int(input())
if s%3==0:
  if s!=0:
    print(3)
  else:
    print(0)
elif s%3==1:
  print(1)
else:
  print(2)

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

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

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

Solution (Python):
a = input()
n = 0
for i in a:
    n += int(i)
print(n)

Solution (Python):
s = input()

print(s.count("1"))

Solution (Python):
s = input()

cnt = 0;

for temp in s:
    if temp == "1":
        cnt += 1
print (cnt)

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

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

print (count)

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

ans = tmp.count('1')

print(ans)

Solution (Python):
charList = list(input())
filtered = [char for char in charList if char == "1"]
filteredNum = len(filtered)
print(filteredNum)

Solution (Python):
print(sum([s == "1" for s in input()]))

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

Solution (Python):


input_nums=list(input())
ans=int(input_nums[0])+int(input_nums[1])+int(input_nums[2])

print(ans)

Solution (Python):

def main():
    print(str(input()).count("1"))

main()

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

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

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

Solution (Python):
S = input()

print(S.count('1'))

Solution (Python):
def main():
    S = input()
    print(sum(1 if s == "1" else 0 for s in S))


if __name__ == '__main__':
    main()

Solution (Python):
s1s2s3 = input()

ans = s1s2s3.count("1")

print(ans)

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 = list(input())

print (S.count('1'))

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

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

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

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

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

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


main()

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

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

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

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

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):
A = input()
s = 0
for i in range(len(A)):
  if A[i]=="1":
    s = s + 1
print(s)

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

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

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

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

Solution (Python):


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

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

Solution (Python):
a = input()
a = list(a)
x = int(a[0])
y = int(a[1])
z = int(a[2])

if x + y + z == 0:
    print('0')
elif x + y + z == 1:
    print('1')
elif x + y + z == 2:
    print('2')
elif x + y + z == 3:
    print('3')

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

Solution (Python):
a = input()

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

Solution (Python):
D = input()
DL = [D[i] for i in range(3)]

print(DL.count('1'))

Solution (Python):
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    s_arr = [int(s) for s in _in[0]]
    
    cnt = sum(s_arr)
    
    print(cnt)

Solution (Python):
s = input()

cnt = 0

for num in range(3):
	if s[num] == '1':
		cnt += 1


print(cnt)

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

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

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

print(s.count("1"))

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

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

print(sum(a))

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

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

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

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

Solution (Python):
slist=list(input())
a = 0
for s in slist:
  if int(s):
    a += 1
print(a)

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

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

Solution (Python):
s = input()

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

Solution (Python):
s = input()

number = 0
if s[0] == "1":
  number += 1
if s[1] == "1":
  number += 1
if s[2] == "1":
  number += 1
print(number)

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

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

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

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

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
    else:
        pass

print(ans)

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

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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

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

print(cnt)

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

Solution (Python):


s = input().rstrip()
result = s.count('1')
print(result)

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

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

Solution (Python):

n = input()

lis = list(n)

count = 0

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

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

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

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

Solution (Python):
n=int(input())
ans=0
for _ in range(3):
    if n%10 == 1:
        ans+=1
    n=n//10
print(ans)

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

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

Solution (Python):
data = map(int,input())


print(sum(data))

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

Solution (Python):
ans = 0
l = input()
for i in range(len(l)):
  ans += int(l[i])
print(ans)

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

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

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

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

print(x)

Solution (Python):
import sys

def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))

INIT_VAL = 0
def DD2(d1,d2): return [[INIT_VAL]*d2 for _ in range(d1)]
def DD3(d1,d2,d3): return [DD2(d2,d3) for _ in range(d1)]

def to_bin(x: int) -> str: return format(x, 'b') 
def to_oct(x: int) -> str: return format(x, 'o') 
def to_hex(x: int) -> str: return format(x, 'x') 
MOD=10**9+7
def divc(x,y) -> int: return -(-x//y)
def divf(x,y) -> int: return x//y
def gcd(x,y):
    while y: x,y = y,x%y
    return x
def lcm(x,y): return x*y//gcd(x,y)
def enumerate_divs(n):
    """Return a tuple list of divisor of n"""
    return [(i,n//i) for i in range(1,int(n**0.5)+1) if n%i==0]
def get_primes(MAX_NUM=10**3):
    """Return a list of prime numbers n or less"""
    is_prime = [True]*(MAX_NUM+1)
    is_prime[0] = is_prime[1] = False
    for i in range(2, int(MAX_NUM**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i*2, MAX_NUM+1, i):
            is_prime[j] = False
    return [i for i in range(MAX_NUM+1) if is_prime[i]]

from itertools import accumulate as acc
from collections import deque, Counter
from heapq import heapify, heappop, heappush
from bisect import bisect_left



def main():
    s = Counter(IS())
    print(s['1'])

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Solution (Python):
s = input()

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

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

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

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 = list(input())
print(s.count("1"))

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

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

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

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

Solution (Python):
def resolve():
    
    n = str(input())
    
    
    
    
    
    
    
    

    print(n.count(str(1)))


resolve()

Solution (Python):
x = int(input())
i = 0
if x//100 == 1:
    i = i + 1
    x = x - 100
    if x//10 ==1:
        i = i + 1
        x = x - 10
        if x == 1:
            i = i + 1
    else:
        if x == 1:
            i = i + 1
else:
    if x//10 == 1:
        i = i + 1
        x = x - 10
        if x == 1:
            i = i + 1
    else:
        if x == 1:
            i = i + 1     

print(i)

Solution (Python):
line = list(input())
l = [int(s) for s in line]
a = sum(l)

print(a)

Solution (Python):


s = int(input())
t = str(s)
print(t.count('1'))

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

Solution (Python):
a = int(input())
ans = a%10 + (int(a/10))%10 + int(a/100)%10
print(ans)

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

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