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 {

	@SuppressWarnings("resource")
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		String S=sc.next();
		String[] S2=S.split("");
		int N=S2.length;
		for(int i=0;i<N/2;i++) {
			if(!S2[0+i].equals(S2[N-1-i])) {
				System.out.println("No");
				System.exit(0);}
		}
		for(int i=0;i<((N-1)/2)-1;i++) {
			if(!S2[0+i].equals(S2[(N-1)/2-1-i])||!S2[(N+3)/2-1+i].equals(S2[N-1-i])) {
				System.out.println("No");
				System.exit(0);}

	}System.out.println("Yes");
		}
}
