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.*;
import java.lang.*;
public class Main {
	public static boolean checkPalindrome(char[] arr, int a, int b){
		for(int i=a;i<b-a;i++){
			if(arr[i]!=arr[b-a-i-1]){
				return false;
			}
		}
		return true;

	}
	public static void main(String args[]){
		Scanner sc=new Scanner(System.in);
		char[] s=sc.nextLine().toCharArray();
		int n=s.length;
		if(checkPalindrome(s,0,n)&&checkPalindrome(s,0,(n-1)/2)&&checkPalindrome(s,(n+3)/2,n)){
			System.out.print("Yes");
		}
		else{
			System.out.println("No");
		}
	}
}