{"problem":{"name":"To 3","description":{"content":"Given is a positive integer $N$, where none of the digits is $0$.   Let $k$ be the number of digits in $N$. We want to make a multiple of $3$ by erasing at least $0$ and at most $k-1$ digits from $N$ ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc182_c"},"statements":[{"statement_type":"Markdown","content":"Given is a positive integer $N$, where none of the digits is $0$.  \nLet $k$ be the number of digits in $N$. We want to make a multiple of $3$ by erasing at least $0$ and at most $k-1$ digits from $N$ and concatenating the remaining digits without changing the order.  \nDetermine whether it is possible to make a multiple of $3$ in this way. If it is possible, find the minimum number of digits that must be erased to make such a number.\n\n## Constraints\n\n*   $1 \\le N \\lt 10^{18}$\n*   None of the digits in $N$ is $0$.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc182_c","tags":[],"sample_group":[["35","1\n\nBy erasing the $5$, we get the number $3$, which is a multiple of $3$. Here we erased the minimum possible number of digits - $1$."],["369","0\n\nNote that we can choose to erase no digit."],["6227384","1\n\nFor example, by erasing the $8$, we get the number $622734$, which is a multiple of $3$."],["11","\\-1\n\nNote that we must erase at least $0$ and at most $k-1$ digits, where $k$ is the number of digits in $N$, so we cannot erase all the digits.  \nIn this case, it is impossible to make a multiple of $3$ in the way described in the problem statement, so we should print `-1`."]],"created_at":"2026-03-03 11:01:14"}}