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.
s = list(map(int,input().split()))

temp = 0

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

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

print(s)