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.
li = input().split() #li = ['1','2','3','4']
ans = li.count('1')
print(ans)
li = list(input()) #s=['a','b','c']
ans = li.count('1')
print(ans)