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.
str = input()
print(str)
counter = 0

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

print(counter)
str = input()

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

print(counter)
