Polycarp and Div 3（CodeForces 1005D）

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

Copy

3121

output

Copy

2

input

Copy

6

output

Copy

1

input

Copy

1000000000000000000000000000000000

output

Copy

33

input

Copy

201920181

output

Copy

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 3333digits 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个至少能满足条件一次（如果不考虑，可能卡在2,2,1这种数据）。当截取长度为2时，每一位都对3取余，可能剩余的情况有(1,1),(2,2),(1,2)(2,1)，其他都满足被3整除，而且这四个的后两个满足条件，所以截取长度为3的只剩下了（1,1）,(2,2)，后面无论是0,1,2都可以满足条件，所以不满足其他条件时，长度为3的串必能满足题目条件

代码如下：

#include <iostream>
#include <cstdio>
#include <stdlib.h>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <ctime>
#define maxn 55557
#define N 100005
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define lowbit(x) (x&(-x))
#define eps 0.000000001
#define read(x) scanf("%d",&x)
#define put(x) printf("%d\n",x)
#define Debug(x) cout<<x<<" "<<endl
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
typedef long long ll;


int main()
{
    char a[222222]={0};
    cin>>a;
    int l=strlen(a),k=0;
    int sum=0,s=0;
    for(int i=0;i<l;i++)
    {
        sum+=a[i]-'0';
        k++;
        if((a[i]-'0')%3==0||a[i]=='0'||k==3)
        {
            sum=k=0;
            s++;
            continue;
        }
        if(sum%3==0)
        {
            sum=k=0;
            s++;
        }
    }
    cout<<s<<endl;
    return 0;
}