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 in Ruby (2.3.3) (judge verdict: Accepted)

# Problem https://atcoder.jp/contests/abc081/tasks/abc081_a
# Ruby 1st Try

one,two,three = gets.chomp('\n').split('')
answer = 0
if one == '1'
    answer = answer + 1
end
if two == '1'
    answer = answer + 1
end
if three == '1'
    answer = answer + 1
end
puts(answer)