Problem: Polycarp likes numbers that are divisible by 3.

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

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

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 3 that Polycarp can obtain?

Input

The first line of the input contains a positive integer s. The number of digits of the number s is between 1 and 2⋅10^5, inclusive. The first (leftmost) digit is not equal to 0.

Output

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

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 3.

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

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

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;
import java.text.*;

public class Main {
    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in), 32768);
    static PrintWriter out = new PrintWriter(System.out);
    static StringTokenizer t;

    static String sn() {
        while (t == null || !t.hasMoreTokens()) {
            try {
                t = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                throw new RuntimeException();
            }
        }
        return t.nextToken();
    }

    static int ni() {
        return Integer.parseInt(sn());
    }

    static long nlo() {
        return Long.parseLong(sn());
    }

    public static void main(String args[]) {
        int t = 1;//ni();
        while (t-- > 0) {
            solve();
        }
        out.close();
    }

    static long mod = 998244353;

    static long pro(long a, long b) {
        return (a % mod * b % mod) % mod;
    }

    static long add(long a, long b) {
        return (a + b) % mod;
    }

    static long maxn = 500005;

    static int pow(int n) {
        return (int) (Math.log10(n) / Math.log10(2));
    }

    static void solve() {
        String s = sn();
        char c[] = s.toCharArray();
        int n = c.length;
        long max = 0;
        HashMap<Integer, Long> map = new HashMap<>();
        map.put(0, 0l);
        long sum = 0;
        for (int i = n - 1; i >= 0; i--) {
//            out.println(map);
            sum += (c[i] - '0');
            int d = (int) (sum % 3);
            long val = max;
            if (map.containsKey(d)) {
                val = Math.max(val, map.get(d) + 1);
            }
            map.put(d, Math.max(map.getOrDefault(d, 0l), val));
            max = Math.max(max, map.get(d));
        }
        out.println(max);
//        long dp[] = new long[n];
//        if ((c[n - 1] - '0') % 3 == 0)
//            dp[n - 1] = 1;
//        for (int i = n - 2; i >= 0; i--) {
//            int sum = 0;
//            if (c[i] == '0') {
//                dp[i] = dp[i + 1] + 1;
//                continue;
//            }
//            for (int j = i; j < n; j++) {
//                sum += (c[j] - '0');
//                if (sum % 3 == 0) {
//                    if (j + 1 == n)
//                        dp[i] = Math.max(dp[i], 1);
//                    else
//                        dp[i] = Math.max(dp[i], dp[j + 1] + 1);
//                } else if (j + 1 < n)
//                    dp[i] = Math.max(dp[i], dp[j + 1]);
//            }
//        }
//        out.println(dp[0]);
    }
}