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 in = new Scanner(System.in);
		String s1 = in.next();
		String sFirst = s1.substring(0, (s1.length() - 1) / 2);
		String sSecond = s1.substring((s1.length() + 1) / 2, s1.length());
		char[] c1 = s1.toCharArray();
		char[] c2 = new char[s1.length()];
		for (int i = 0; i < s1.length(); i++) {
			c2[i] = c1[(s1.length() - 1) - i];
		}
		String s2 = String.valueOf(c2);
		
		System.out.println(s1.equals(s2) && sFirst.equals(sSecond) ? "Yes" : "No");
	}
}	