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 scanner = new Scanner(System.in);

		char[] s  = scanner.nextLine().toCharArray();
		int n     = s.length;
		int mid   = (n - 1) / 2 + 1;
		String an = "Yes";

		for(int i = 0; i < mid; i++) {

			if(s[i] != s[n - i - 1]) {

				an = "No";
				break;
			}
		}

		int mmid = (mid - 1) / 2 + 1;
		int nn   = mid -1;
		for(int i = 0; i < mmid; i++) {

			if(s[i] != s[nn - i - 1]) {

				an = "No";
				break;
			}
		}

		int start = (n + 3) / 2 + n;
		int mmmid = start / 2 + 1;
		for(int i = start; i < mmmid; i++) {

			if(s[i] != s[n - i - 1]) {

				an = "No";
				break;
			}
		}
		System.out.println(an);

	}
}