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.*;
import java.math.*;
public class Main {
	static int r; 
	static int c;
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String s = in.next();
		int r = s.length() - 1;
		String ans = "Yes";
		if(isPal(s.substring(0, ((r - 1) / 2) + 1)) == false) ans = "No";
		if(isPal(s.substring((r + 3) / 2, r + 1)) == false) ans = "No";
		if(isPal(s) == false) ans = "No";
		System.out.println(ans);
	}
	public static boolean isPal(String s) {
		int l = 0;
		int r = s.length() - 1;
		while(l <= r) {
			if(s.charAt(l) != s.charAt(r)) return false;
			l += 1;
			r -= 1;
		}
		return true;
	}
} 
