A string is a palindrome if it reads the same from the left to the right and from the right to the left. For example, the strings "kek", "abacaba", "r" and "papicipap" are palindromes, while the strings "abb" and "iq" are not.

A substring s[l … r] (1 ≤ l ≤ r ≤ |s|) of a string s = s_{1}s_{2} … s_{|s|} is the string s_{l}s_{l + 1} … s_{r}.

Anna does not like palindromes, so she makes her friends call her Ann. She also changes all the words she reads in a similar way. Namely, each word s is changed into its longest substring that is not a palindrome. If all the substrings of s are palindromes, she skips the word at all.

Some time ago Ann read the word s. What is the word she changed it into?

Input

The first line contains a non-empty string s with length at most 50 characters, containing lowercase English letters only.

Output

If there is such a substring in s that is not a palindrome, print the maximum length of such a substring. Otherwise print 0.

Note that there can be multiple longest substrings that are not palindromes, but their length is unique.

Examples

Input

mew


Output

3


Input

wuffuw


Output

5


Input

qqqqqqqq


Output

0

Note

"mew" is not a palindrome, so the longest substring of it that is not a palindrome, is the string "mew" itself. Thus, the answer for the first example is 3.

The string "uffuw" is one of the longest non-palindrome substrings (of length 5) of the string "wuffuw", so the answer for the second example is 5.

All substrings of the string "qqqqqqqq" consist of equal characters so they are palindromes. This way, there are no non-palindrome substrings. Thus, the answer for the third example is 0.
import java.util.*;
import static java.lang.Math.min;
import static java.lang.Math.abs;
import static java.lang.Math.max;
import java.io.*;

public class Codechef {
	static long[] mods = {1000000007, 998244353, 1000000009};
	static long mod = mods[0];
	public static MyScanner in;
    public static PrintWriter out;
    static int[][] dp;
    static ArrayList<ArrayList<Integer>> tree;
    static List<String> al = new ArrayList<>();
    
	public static void main( String[] args ) throws IOException{
		
 		in = new MyScanner();
 		out = new PrintWriter(System.out);
 		StringBuilder ans1=new StringBuilder();
		int test=1;
		while(test-->0) {
			 String temp=in.next();
                   int len=temp.length();
                   int count=0;
                   while (temp.length()>0 && palindrome(temp)) {
                     temp=temp.substring(0,temp.length()-1);
                     count++;
                   }
                   
			
			out.println(len-count);
			//ans1.append(ans).append(System.getProperty("line.separator"));
		}
		
		//out.println(ans1);
 		out.close();
 		
 	}
 	
 	static boolean palindrome(String s){
          return s.equals(new StringBuilder(s).reverse().toString());
     }

	//comparator to solve according to b in descending order
	static class Pair implements Comparable<Pair>{
		private long a;
		private long b;
		public Pair(long a, long b) {
			this.a = a;
			this.b = b;
		}
		public int compareTo(Pair other) {
			//return Long.compare(this.b, other.b );		//to sort in ascending order swap the arguments in Long.compare
			return Long.compare(other.b ,this.b); 	//to sort in descending order swap the arguments in Long.compare
		}
	}
	
	static void printArray(long[] a) {
		StringBuilder stringBuilder=new StringBuilder();
		for(long i: a)	stringBuilder.append(i).append(" ");
		out.println(stringBuilder);
	}
	
	public static void sort(long[] array){
		ArrayList<Long> copy = new ArrayList<>();
		for (long i : array)
			copy.add(i);
		Collections.sort(copy);
		for(int i = 0;i<array.length;i++)
			array[i] = copy.get(i);
	}
	
	public static void sortDes(long[] array){
		ArrayList<Long> copy = new ArrayList<>();
		for (long i : array)
			copy.add(i);
		Collections.sort(copy);
		int j=array.length-1;
		for(int i = 0;i<array.length;i++)
			array[j--] = copy.get(i);
	}
	
	
	static String[] readArrayString(int n){
		String[] array = new String[n];
		for(int j =0 ;j<n;j++)
			array[j] = in.next();
		return array;
	}
	
	
	static int[] readArrayInt(int n){
    	int[] array = new int[n];
    	for(int j = 0;j<n;j++)
    		array[j] = in.nextInt();
    	return array;
    }
	
	static int[] readArrayInt1(int n){
		int[] array = new int[n+1];
		for(int j = 1;j<=n;j++){
			array[j] = in.nextInt();
		}
		return array;
	}
	
	static long[] readArrayLong(int n){
		long[] array = new long[n];
		for(int j =0 ;j<n;j++)
			array[j] = in.nextLong();
		return array;
	}
	
	static double[] readArrayDouble(int n){
		double[] array = new double[n];
		for(int j =0 ;j<n;j++)
			array[j] = in.nextDouble();
		return array;
	}
	
	static int minIndex(int[] array){
		int minValue = Integer.MAX_VALUE;
		int minIndex = -1;
		for(int j = 0;j<array.length;j++){
			if (array[j] < minValue){
				minValue = array[j];
				minIndex = j;
			}
		}
		return minIndex;
	}
	
	static int minIndex(long[] array){
		long minValue = Long.MAX_VALUE;
		int minIndex = -1;
		for(int j = 0;j<array.length;j++){
			if (array[j] < minValue){
				minValue = array[j];
				minIndex = j;
			}
		}
		return minIndex;
	}
	
	static int minIndex(double[] array){
		double minValue = Double.MAX_VALUE;
		int minIndex = -1;
		for(int j = 0;j<array.length;j++){
			if (array[j] < minValue){
				minValue = array[j];
				minIndex = j;
			}
		}
		return minIndex;
	}
	
	static boolean isPrime(int n)
    {
        if (n <= 1)		return false;
        if (n <= 3)		return true;
        if (n % 2 == 0 || n % 3 == 0)	return false;
 
        for (int i = 5;i * i <= n; i = i + 6)
            if (n % i == 0 || n % (i + 2) == 0)		return false;
        return true;
    }
    
	static ArrayList<Integer> sieveOfEratosthenes(int n)
    {
        ArrayList<Integer> al = new ArrayList<>();
        boolean prime[] = new boolean[n + 1];
        for (int i = 0; i <= n; i++)
            prime[i] = true;
 
        for (int p = 2; p * p <= n; p++)
        {
            if (prime[p] == true)
            {
                for (int i = p * p; i <= n; i += p)
                    prime[i] = false;
            }
        }
        for (int i = 2; i <= n; i++)
        {
            if (prime[i] == true)
                al.add(i);
        }
        return al;
    }
	
	static long power(long x, long y){
		if (y == 0)
			return 1;
		if (y%2 == 1)
			return (x*power(x, y-1))%mod;
		return power((x*x)%mod, y/2)%mod;
	}
	static void verdict(boolean a){
        out.println(a ? "YES" : "NO");
    }
	
	static long gcd_bin(long x, long a)	{
        if (x == 0)		return a;
        if (a == 0)		return x;
        int k;
        for (k = 0; ((x | a) & 1) == 0; ++k){
            x >>= 1;
            a >>= 1;
        }
        while ((x & 1) == 0)	x >>= 1;
        do{
            while ((a & 1) == 0)	a >>= 1;
            if (x > a){
                long temp = x;
                x = a;
                a = temp;
            }
            a = (a - x);
        } while (a != 0);
        return x << k;
    }
	
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } 
                catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt() {
            return Integer.parseInt(next());
        }
        long nextLong() {
            return Long.parseLong(next());
        }
        double nextDouble() {
            return Double.parseDouble(next());
        }
        String nextLine() {
            String str = "";
            try{
                str = br.readLine();
            } 
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
        
    }	
}
