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) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
		char[] str = sc.next().toCharArray();
		
		int n = str.length;
		
		for(int i = 0; i < n/2; i++) {
//			System.out.println(str[i] +" "+ str[(n - 1)/2 - i - 1] +" " + str[i + (n + 1)/2] +" "+ str[n - 1 - i]);
			if((str[i] != str[n - 1 - i]) ||
					(str[i] != str[(n - 1)/2 - i - 1]) ||
					(str[i + (n + 1)/2] != str[n - 1 - i])){
				System.out.println("No");
				return;
			}
		}
		
		System.out.println("Yes");
	}

}
