A string S of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:

* S is a palindrome.
* Let N be the length of S. The string formed by the 1-st through ((N-1)/2)-th characters of S is a palindrome.
* The string consisting of the (N+3)/2-st through N-th characters of S is a palindrome.



Determine whether S is a strong palindrome.

Constraints

* S consists of lowercase English letters.
* The length of S is an odd number between 3 and 99 (inclusive).

Input

Input is given from Standard Input in the following format:


S


Output

If S is a strong palindrome, print `Yes`; otherwise, print `No`.

Examples

Input

akasaka


Output

Yes


Input

level


Output

No


Input

atcoder


Output

No
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args)
	{
		Scanner s=new Scanner(System.in);
		
		String str=s.next();
		int n=str.length();
		
		int c=0;
		
		if(check(str))
			c++;
		if(check(str.substring(0,(n-1)/2)))
		{
			c++;
		}
		if(check(str.substring(((n+3)/2)-1,n)))
		{
			c++;
		}
		
		if(c==3)
			System.out.println("Yes");
		else
			System.out.println("No");
	}
	
	public static boolean check(String str)
	{
		int p=0;
		
		for(int i=0;i<str.length();i++)
		{
			if(str.charAt(i)!=str.charAt(str.length()-1-i))
			{
				p=1;
				break;
			}
		}
		
		if(p==1)
			return false;
		else
			return true;
	}
	
}