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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        char[] chars;
        int n;
        int[][][] memo;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            chars = in.next().toCharArray();
            n = chars.length;
            memo = new int[n + 1][2][2];
            for (int i = 0; i < n + 1; i++) {
                for (int j = 0; j < 2; j++) {
                    for (int k = 0; k < 2; k++) {
                        memo[i][j][k] = -1;
                    }
                }
            }
//        int i = 0, j = n - 1;
//        while (i < n && chars[i] == 'a') {
//            i++;
//        }
//        while (j >= 0 && chars[j] == 'a') {
//            j--;
//        }
//        if (i == n || j == -1) {
//            out.println(n);
//        } else {
//            int count = 0;
//            for (int k = i; k <= j; k++) {
//                if (chars[k] == 'a') {
//                    count++;
//                }
//            }
//            out.println(Math.max(n - count, n - ((j - i + 1) - count)));
//        }
            out.println(dp(0, 0, 0));
        }

        int dp(int i, int c, int flag) {
            if (i == n) return 0;
            if (memo[i][c][flag] != -1) return memo[i][c][flag];
            int answer = dp(i + 1, c, flag);
            if (i == 0) {
                answer = Math.max(answer, 1 + dp(i + 1, chars[i] - 'a', flag));
            } else {
                if (chars[i] == 'a') {
                    if (flag == 1) {
                        answer = Math.max(answer, 1 + dp(i + 1, 0, 1));
                    } else {
                        if (c == 0) {
                            answer = Math.max(answer, 1 + dp(i + 1, 0, 0));
                        } else {
                            answer = Math.max(answer, 1 + dp(i + 1, 0, 1));
                        }
                    }
                } else {
                    if (c == 1 || (c == 0 && flag == 0)) {
                        answer = Math.max(answer, 1 + dp(i + 1, 1, 1));
                    }
                }
            }
            return memo[i][c][flag] = answer;
        }

    }

    static class InputReader {
        private int lenbuf = 0;
        private int ptrbuf = 0;
        private InputStream in;
        private byte[] inbuf = new byte[1024];

        public InputReader(InputStream in) {
            this.in = in;
        }

        private int readByte() {
            if (lenbuf == -1) throw new InputMismatchException();
            if (ptrbuf >= lenbuf) {
                ptrbuf = 0;
                try {
                    lenbuf = in.read(inbuf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (lenbuf <= 0) return -1;
            }
            return inbuf[ptrbuf++];
        }

        private boolean isSpaceChar(int c) {
            return !(c >= 33 && c <= 126);
        }

        private int skip() {
            int b;
            while ((b = readByte()) != -1 && isSpaceChar(b)) ;
            return b;
        }

        public String next() {
            int b = skip();
            StringBuilder sb = new StringBuilder();
            while (!(isSpaceChar(b))) {
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }

    }
}