import java.util.*;

class Main {
    static int longestPalindrome(String s) {
        int length = s.length();
        int count = 0;
        for (int i = 0; i < length / 2; ++i) {
            if (s.charAt(i) == s.charAt(length - 1 - i)) {
                count += 2;
            }
        }
        if (length % 2 == 1) {
            count++;
        }
        return count;
    }
    public static void main(String[] args) {
	Scanner scan = new Scanner(System.in);
        String s = scan.next();
        int length = s.length();
        int maximum = 0;
        for (int i = 1; i <= length; ++i) {
            maximum = Math.max(maximum, longestPalindrome(s.substring(0, i)));
        }
        for (int i = 1; i <= length; ++i) {
            maximum = Math.max(maximum, longestPalindrome(s.substring(length - i, length)));
        }
        System.out.println(maximum);
    }
}