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) {
		Scanner sc = new Scanner(System.in);
		String s1 = sc.next();
		sc.close();

		String s2 = s1.substring(0, (s1.length() - 1) / 2);
		String s3 = s1.substring((s1.length() + 3) / 2 - 1);
		boolean result = isPalindrome(s1) && isPalindrome(s2) && isPalindrome(s3);

		System.out.println(result ? "Yes" : "No");
	}

	private static boolean isPalindrome(String text) {
		for (int i = 0; i < text.length(); i++) {
			String s1 = text.substring(i, i + 1);
			String s2 = text.substring(text.length() - i - 1, text.length() - i);
			if (!s1.equals(s2)) {
				return false;
			}
		}

		return true;
	}
}
