Problem:
 Score : 100 points    Problem Statement Snuke prepared 6 problems for a upcoming programming contest.
For each of those problems, Rng judged whether it can be used in the contest or not.  You are given a string S of length 6 .
If the i -th character of s is 1 , it means that the i -th problem prepared by Snuke is accepted to be used; 0 means that the problem is not accepted.  How many problems prepared by Snuke are accepted to be used in the contest?      Constraints  The length of S is 6 .  S consists of 0 and 1 .         Inputs Input is given from Standard Input in the following format:  S       Outputs Print the number of problems prepared by Snuke that are accepted to be used in the contest.        Sample Input 1 111100      Sample Output 1 4  The first, second, third and fourth problems are accepted, for a total of four.       Sample Input 2 001001      Sample Output 2 2       Sample Input 3 000000      Sample Output 3 0

Solution (Python):
S = input()
print(S.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):
N = int(input())
ans = 0
for i in range(6):
  ans += N % 10
  N //= 10
print(ans)

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

Solution (Python):
from collections import Counter
ans = Counter(input())['1']
print(ans)

Solution (Python):
print(sum(int(T) for T in input()))

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

Solution (Python):
def pcnt(n):
    c = (n & 0x5555555555555555) + ((n>>1) & 0x5555555555555555)
    c = (c & 0x3333333333333333) + ((c>>2) & 0x3333333333333333)
    c = (c & 0x0f0f0f0f0f0f0f0f) + ((c>>4) & 0x0f0f0f0f0f0f0f0f)
    c = (c & 0x00ff00ff00ff00ff) + ((c>>8) & 0x00ff00ff00ff00ff)
    c = (c & 0x0000ffff0000ffff) + ((c>>16) & 0x0000ffff0000ffff)
    c = (c & 0x00000000ffffffff) + ((c>>32) & 0x00000000ffffffff)
    return c
    
print(pcnt(int(input(),2)))

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil,pi,factorial
    from operator import itemgetter
    def I(): return int(input())
    def MI(): return map(int, input().split())
    def LI(): return list(map(int, input().split()))
    def LI2(): return [int(input()) for i in range(n)]
    def MXI(): return [[LI()]for i in range(n)]
    def SI(): return input().rstrip()
    def printns(x): print('\n'.join(x))
    def printni(x): print('\n'.join(list(map(str,x))))
    inf = 10**17
    mod = 10**9 + 7

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

        
        
        
        
    
if __name__=="__main__":
    main()

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

print(count)

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

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

Solution (Python):
s = input()
x = 0
for i in range(6):
    x += int(s[i])

print(x)

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


if __name__ == "__main__":
    main()

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

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

Solution (Python):

import sys
def input():
    return sys.stdin.readline()[:-1]

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys

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


def main():
    S = input()

    print(S.count("1"))


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import sys
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  


print(sum(LI2()))

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

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

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
s = S()
print(s.count('1'))

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

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

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

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

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):
s = input()
ans=0
for i in s:
    if i=='1':
        ans+=1
print(ans)

Solution (Python):
'''
Created on 2020/08/20

@author: harurun
'''
def main():
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  S=pin()[:-1]
  print(S.count("1"))
  return 

main()

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

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

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

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

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

Solution (Python):

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

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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

if __name__ == '__main__':
    main()

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

Solution (Python):
s = input()
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):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    S = SS()

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

if __name__ == '__main__':
    resolve()

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

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

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

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

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

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

print(c)

Solution (Python):



L = []
p1 = 0
p2 = float('inf')
r1 = float('inf')
r2 = 0
S = list(input())

ans = 0
for s in S:
    if s == "1":
        ans += 1
    
print(ans)

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

Solution (Python):
S = input()
cnt = 0
for i in S:
  cnt += int(i)
print(cnt)

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    S = input().rstrip()
    ans = S.count("1")
    print(ans)


if __name__ == "__main__":
    main()

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

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

Solution (Python):


import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union































def main():
    Num = Union[int, float]
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input():  return sys.stdin.readline().rstrip()
    def ii():     return int(input())
    def isp():    return input().split()
    def mi():     return map(int, input().split())
    def mi_0():   return map(lambda x: int(x)-1, input().split())
    def lmi():    return list(map(int, input().split()))
    def lmi_0():  return list(map(lambda x: int(x)-1, input().split()))
    def li():     return list(input())
    def debug(x): print(x, file=sys.stderr)
    
    
    
    s = input()
    print(s.count('1'))


if __name__ == "__main__":
    main()

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

Solution (Python):
a = int(input())
count = 0
while a != 0:
    rem = a % 10
    if rem == 1:
        count += 1
    a //= 10
print(count)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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(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):
print(input().count('1'))

Solution (Python):


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    s=input()
    print(s.count("1"))

main()

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

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

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

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

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

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

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

print(s.count("1"))

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

Solution (Python):
s = input()

print(s.count('1'))

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

Solution (Python):
def main():
    s = list(map(int, list(input())))
    print(sum(s))
if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, 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, insort, insort_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):
ans = str(input()).count('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())
print(s.count('1'))

Solution (Python):






import sys
input = sys.stdin.readline

import math

import bisect
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache






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






def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]


def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()


def DD(arg): return defaultdict(arg)



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 make_divisors(n):
  divisors = []
  for i in range(1, int(n**0.5)+1):
    if n % i == 0:
      divisors.append(i)
      if i != n // i: 
        divisors.append(n//i)
  return divisors


def make_primes(N):
  max = int(math.sqrt(N))
  seachList = [i for i in range(2,N+1)]
  primeNum = []
  while seachList[0] <= max:
    primeNum.append(seachList[0])
    tmp = seachList[0]
    seachList = [i for i in seachList if i % tmp != 0]
  primeNum.extend(seachList)
  return primeNum


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


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


def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count


def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i-1])*n**i for i in range(len(str(X))))


def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count




print(Counter(S())["1"])

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

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

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

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

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=S.count("1")
print(ans)

Solution (Python):
from sys import stdin
import math
import re
import queue

input = stdin.readline

MOD = 1000000007
INF = 122337203685477580

def solve():
    str = (input().rstrip())
    print(str.count("1"))


if __name__ == '__main__':
    solve()

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

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

cnt = 0
for i in range(len(S)):
    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):
print(input().count("1"))

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 = input()
l = []
for i in str(a):
    if i == '1':
        l.append(i)
print(len(l))

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

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

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

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

print(count)

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

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

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

if __name__ == '__main__':
    main()

155284

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

  print(S.count('1'))

if __name__ == "__main__":
  main()

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

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

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

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()
c = Counter(S)
print(c["1"])

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

print(sum(S))

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

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

def resolve():
    s=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()
    s = [int(c) for c in s]
    print(s.count(1))



resolve()

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

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

print(l)

Solution (Python):
from sys import stdin
S = stdin.readline().rstrip()
print(S.count('1'))

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

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

Solution (Python):


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

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

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

Solution (Python):
S = input()

print(S.count('1'))

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s=input()
    ans=0
    for ss in s:
        if ss=='1':ans+=1
    print(ans)

if __name__=='__main__':
    main()

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

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

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

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

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

Solution (Python):

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

Solution (Python):
s=list(str(input()))
t=0
c=0
for i in range(6):
  t=s.pop()
  if t=='1':
    c+=1
print(c)

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

Solution (Python):
S = input()
ans = 0
for s in S:
    if s == "1":
        ans += 1

print(ans)

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

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    s = input()
    count =0
    
    for i in range(6):
        if "1" == s[i]:
            count+=1
    print(count)

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

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

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

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
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 = 1e10


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



if __name__ == '__main__':
    solve()

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()
ans = 0
for i in range(len(S)):
    if S[i] == '1':
        ans += 1
print(ans)

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
S = input()
print(S.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
print(ans)

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

Solution (Python):
s = input()

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

Solution (Python):
S = input()

print(S.count('1'))

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

Solution (Python):
S=input()
number=0
for a in S:
    if a=='1':
        number+=1
print(number)

Solution (Python):
def main():
    s = input().rstrip()
    ans = 0
    for c in s:
        if c == "1":
            ans += 1
    print(ans)

if __name__ == "__main__":
    main()

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

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

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

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(6):
    if s[i]=="1":
        ans+=1
print(ans)

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

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

Solution (Python):
s = input()

ans = 0

for i in range(6):
	if s[i] == '1':
		ans += 1

print(ans)

Solution (Python):
import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)


def dump_impl(*objects):
    print(*objects, file=sys.stderr)


def dump_dummy(*objects):
    pass


dump = dump_impl if "DEBUG" in sys.argv else dump_dummy

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

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

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

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

Solution (Python):


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

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

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

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

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

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

Solution (Python):
s=int(input())
count=0
for i in range(len(str(s))):
    if s%10==1:
        count+=1
    s=s//10
print(count)

Solution (Python):
import math
import itertools



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

print(count)

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

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

Solution (Python):








mod = int(1e9+7)

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

if __name__=='__main__':
    main()

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

Solution (Python):

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

Solution (Python):

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

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

Solution (Python):
N=input()
print(sum([int(N[i]) for i in range(6)]))

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

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

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

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

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

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

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

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

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

ans = 0

for ss in s:
    ans += int(ss)
print(ans)

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

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

Solution (Python):
s=input()

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

print(c)

Solution (Python):

 
import math
import itertools
import sys
import copy
 





S = str(input())

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

print (cnt)

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

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

print(ct)

Solution (Python):
def main(s):
    ans = 0

    for s in s:
        ans += int(s)

    print(ans)


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

    main(s)

Solution (Python):
def main():
    ls = list(input())
    ans = 0
    for i in range(len(ls)):
        if ls[i]=="1":
            ans += 1
    print(ans)
if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()

print(s.count("1"))

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

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


if __name__ == '__main__':
    main()

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    print(ST().count("1"))
if __name__ == '__main__':
    main()

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

Solution (Python):


S = list(input())

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

print(ans)

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

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

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

Solution (Python):

s = input()

print(s.count("1"))

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

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

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

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

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().strip()
print(S.count("1"))