Polycarp and Div 3 CodeForces - 1005D ---小shi shi 给小天天的 Day2

Polycarp likes numbers that are divisible by 3.

He has a huge number ss. Polycarp wants to cut from it the maximum number of numbers that are divisible by 33. To do this, he makes an arbitrary number of vertical cuts between pairs of adjacent digits. As a result, after mm such cuts, there will be m+1m+1 parts in total. Polycarp analyzes each of the obtained numbers and finds the number of those that are divisible by 33.

For example, if the original number is s=3121s=3121, then Polycarp can cut it into three parts with two cuts: 3|1|213|1|21. As a result, he will get two numbers that are divisible by 33.

Polycarp can make an arbitrary number of vertical cuts, where each cut is made between a pair of adjacent digits. The resulting numbers cannot contain extra leading zeroes (that is, the number can begin with 0 if and only if this number is exactly one character '0'). For example, 007, 01 and 00099 are not valid numbers, but 90, 0 and 10001 are valid.

What is the maximum number of numbers divisible by 33 that Polycarp can obtain?

Input

The first line of the input contains a positive integer ss. The number of digits of the number ss is between 11 and 2⋅1052⋅105, inclusive. The first (leftmost) digit is not equal to 0.

Output

Print the maximum number of numbers divisible by 33 that Polycarp can get by making vertical cuts in the given number ss.

Examples

Input

3121

Output

2

Input

6

Output

1

Input

1000000000000000000000000000000000

Output

33

Input

201920181

Output

4

Note

In the first example, an example set of optimal cuts on the number is 3|1|21.

In the second example, you do not need to make any cuts. The specified number 6 forms one number that is divisible by 33.

In the third example, cuts must be made between each pair of digits. As a result, Polycarp gets one digit 1 and 3333 digits 0. Each of the 3333 digits 0 forms a number that is divisible by 33.

In the fourth example, an example set of optimal cuts is 2|0|1|9|201|81. The numbers 00, 99, 201201 and 8181 are divisible by 33.

题意:

给你一个老长长的数 ， 问你这个数的每一位能整除3的有多少个 ， 也可以连续几个相加整除3.

输出最多的个数。

比如3121  它可以是【3】 【1+2】 【1】其中有俩个符合 ， 然后答案是2；

思路：

有一个关键点是：（1）连续3个肯定能整除3 ， 为啥嘞？

瞅瞅有哪些情况 ， 不能整除3 那余的情况就只能是1 和 2了。

 1 1 1----2 2 2---1 2 1 ---- 2 1 2--- 2 1 1.。。。。。。。

都有整除3 的情况 ， 解释完毕

那上面那个就算是一个条件了 ， （2）还有这个数是0 的时候

（3）一个数就可以整除3

就这三个条件 ， 可以写代码了

代码：

#include <bits/stdc++.h>
using namespace std;
int main()
{
	string str;
	int n , m = 0, k = 0 , ans = 0;
	cin >> str;
		for(int i = 0 ; i < str.length() ; i++)
		{
				if((str[i]-'0')%3 == 0)
				{
					ans++;
					m = 0;
					k = 0;
				}
				else
				{
					m += (str[i]-'0');
					k++;
					if(m%3==0)
					{
						ans++;
						m = 0;
						k = 0;
					}
					else if(k == 3)
					{
						ans++;
						m = 0;
						k = 0;
					}
				}			
		}
	
	printf("%d\n" , ans);
	return 0;
}