{"raw_statement":[{"iden":"problem statement","content":"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$.\nSnuke will place a marble on each square that says `1`. Find the number of squares on which Snuke will place a marble."},{"iden":"constraints","content":"*   Each of $s_1$, $s_2$ and $s_3$ is either `1` or `0`."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$s_{1}s_{2}s_{3}$"},{"iden":"sample input 1","content":"101"},{"iden":"sample output 1","content":"2\n\n*   A marble will be placed on Square $1$ and $3$."},{"iden":"sample input 2","content":"000"},{"iden":"sample output 2","content":"0\n\n*   No marble will be placed on any square."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}