Problem: One day Nikita found the string containing letters "a" and "b" only. 

Nikita thinks that string is beautiful if it can be cut into 3 strings (possibly empty) without changing the order of the letters, where the 1-st and the 3-rd one contain only letters "a" and the 2-nd contains only letters "b".

Nikita wants to make the string beautiful by removing some (possibly none) of its characters, but without changing their order. What is the maximum length of the string he can get?

Input

The first line contains a non-empty string of length not greater than 5 000 containing only lowercase English letters "a" and "b". 

Output

Print a single integer — the maximum possible size of beautiful string Nikita can get.

Examples

Input

abba


Output

4

Input

bab


Output

2

Note

It the first sample the string is already beautiful.

In the second sample he needs to delete one of "b" to make it beautiful.

Solution (in JAVA):

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

public class TaskD {
    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        Solve solve = new Solve();
        solve.solve(in, out);
        out.close();
    }

    private static class Solve {
        public void solve(InputReader in, PrintWriter out) {
            String s = in.next();
            int n = s.length();
            int[] prevA = new int[n];
            prevA[0] = s.charAt(0) == 'a' ? 1 : 0;
            int[] prevB = new int[n];
            prevB[0] = s.charAt(0) == 'b' ? 1 : 0;
            for (int i = 1; i < n; i++) {
                prevA[i] = prevA[i - 1];
                prevA[i] += s.charAt(i) == 'a' ? 1 : 0;
                prevB[i] = prevB[i - 1];
                prevB[i] += s.charAt(i) == 'b' ? 1 : 0;
            }
            int answer = 0;
            for (int i = 0; i <= n; i++) {
                for (int j = i; j <= n; j++) {
                    int a = i == 0 ? 0 : prevA[i-1];
                    int b = i == j ? 0 : ((j == 0 ? 0 : prevB[j-1]) - (i == 0 ? 0 : prevB[i-1]));
                    int c = prevA[n-1] - (j == 0 ? 0 : prevA[j-1]);
                    answer = StrictMath.max(a + b + c, answer);
                }
            }
            out.print(answer);
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
}