{"problem":{"name":"Placing Marbles","description":{"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$. Snuke will place a marble on each squar","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc081_a"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   Each of $s_1$, $s_2$ and $s_3$ is either `1` or `0`.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$s_{1}s_{2}s_{3}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc081_a","tags":[],"sample_group":[["101","2\n\n*   A marble will be placed on Square $1$ and $3$."],["000","0\n\n*   No marble will be placed on any square."]],"created_at":"2026-03-03 11:01:13"}}