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;

class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		String line = sc.nextLine();
		char[] c = line.toCharArray();
		String ans = "Yes";
		int n = c.length;
		for(int i = 0; i < n; i++){
			if(c[i] != c[(n - 1) - i]){
				ans = "No";
			}
		}
		for(int i = 0; i < (n/2); i++){
			if(c[i] != c[((n - 1)/2 - 1) - i]){
				ans = "No";
			}
			if(c[(n + 1)/2 + i] != c[(n - 1) - i]){
				ans = "No";
			}
		}
		System.out.println(ans);
 	}
}