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.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		char[] s = sc.next().toCharArray();
		boolean same = true;
		for(int i = 0; i < s.length; i++) {
			if(s[i] != s[s.length - 1 - i]){
				System.out.println("No");
				System.exit(0);
			}
		}
		for(int j = 0; j <= (s.length - 2) / 2; j++) {
			if(s[j] != s[(s.length - 2) / 2 - j]){
				System.out.println("No");
				System.exit(0);
			}
		}
		int count = 0;
		for(int a = (s.length + 2) / 2; a < s.length; a++){
		if(s[a] != s[(s.length - 2) / 2 - count]){
			System.out.println("No");
			System.exit(0);
		}
		count++;
	}
		System.out.println("Yes");
	}
}