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[] $) {
		Scanner sc = new Scanner(System.in);
		String s=sc.next();
		boolean flag=true;
		int j=s.length();
		for(int i=0;i<s.length()/2;i++) {
			if(!s.substring(i, i+1).equals(s.substring(j-1, j))) flag=false;
			j--;
		}
		j=s.length()/2;
		for(int i=0;i<s.length()/4;i++) {
			if(!s.substring(i, i+1).equals(s.substring(j-1, j))) flag=false;
			j--;
		}
		j=s.length();
		for(int i=s.length()/2+1;i<s.length()/4+s.length()/2+1;i++) {
			if(!s.substring(i, i+1).equals(s.substring(j-1, j))) flag=false;
			j--;
		}
		if(flag) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}
}
