枚举//可用动规写

/*
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.
*/ 
/*
思维题 

我的方法还不够简便可以在改进

对于每一位数  such   3121的3

x = 3;

x%3 <3;

x = 0or1or2;

考虑  if  x = 0  可以被三整除

if x = 1    若  下一位 为 y = 2  或 y=1 z = 1则可被整除

if x = 2   若 下一位  为  y= 1  或 y = 2 z = 2 则可被整除

有   
含 0 的 
0 0 0
0 1 0
1 0 1  
..
不含0
1 1 1
1 2 1
1 1 2
2 2 1
2 1 1
2 2 2 

剩下的可以自己想了 
*/

#include<bits/stdc++.h>
using namespace std;
int tt=0,ll=0;
char ss[1000000];
int main()
{

    scanf("%s",&ss);
    ll = strlen(ss);
    int t1=0,t2=0,t3=0,t=0;
    int time = 0;
    for(int i=0;i<ll;i++)
    {
        int d = ss[i]-'0';
        tt = (ss[i]-'0')%3;
        t1 = t2;
        t2 = t3;
        t3 = tt;
        t +=tt;
        if(d%3==0||t%3==0)
        {
            t1 = 0;
            t2 = 0;
            t3 = 0;
            t = 0;
            time++;
        }
        else if(t1==1&&t2==1&&t3==2)    
        {
            t1 = 0;
            t2 = 0;
            t3 = 0;
            t = 0;
            time++;
        }
        else if(t1==2&&t2==2&&t3==1)
        {
            t1 = 0;
            t2 = 0;
            t3 = 0;
            t = 0;
            time++;
        }
    }
    printf("%d\n",time);
}