Polycarp and Div 3

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+1parts 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的倍数。

思路：先把字符串中的数字每一个mod 3，然后判断，如果是0就说明这个数字只需要一位就可以整出3，cnt+1就行了，如果不是0，那么就判断一下它和它的下一位的加和能不能整除，如果可以那么cnt+1；如果还不行的话，就判断一下下面三个是不是一样的，是一样的就一定能整除的。

code：

（测试的时候一直没做出来，一直以为是尺取 - -，哎，测试结束后，问同学问的。。）

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
int main()
{	
	string str;
	cin>>str;
	int cnt=0;
	for(int i=0;i<str.length();i++)
	{
		str[i]=(str[i]-'0')%3+'0';
	}
	int i=0;
	while(i<str.length())
	{
		if(str[i]=='0')
		{
			cnt++;
			i++;
			continue;
		}
		else 
		{	
			if(str[i+1]==3-(str[i]-'0')+'0' && i<str.length()-1)
			{
				cnt++;
				i+=2;
			}
			else if(str[i+2]==str[i+1] && str[i+1]==str[i]&& i<str.size()-2)
			{
				cnt++;
				i+=3;
			}
			else{
				i++;
			}
		}
		
	}
	cout<<cnt<<endl;
	return 0;
}