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 s = new String(in.nextLine());
		boolean f1=huiwen(s);
		boolean f2=huiwen(s.substring(0, (s.length()-1)/2));
		boolean f3=huiwen(s.substring((s.length()+3)/2-1, s.length()));
		if(f1&&f2&&f3) {
			System.out.println("Yes");
		}
		else {
			System.out.println("No");
		}
	}
	public static boolean huiwen(String ss) {
		StringBuffer a = new StringBuffer(ss);
		String s1 = a.toString();
		String s2 = a.reverse().toString();
		return s1.equals(s2);
	}
}