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 scan = new Scanner(System.in);
		String str = scan.next();
		int n = str.length();
		
		boolean flag = true;
		StringBuffer sb = new StringBuffer(str);
		String dst = sb.reverse().toString();
		if(!dst.equals(str))flag = false;
		
		int x =(n-1)/2;
		int y =(n+3)/2;

		sb = new StringBuffer(str.substring(0, x));
		dst = sb.reverse().toString();
		if(!dst.equals(str.substring(0, x)))flag = false;

		sb = new StringBuffer(str.substring(y - 1, n));
		dst = sb.reverse().toString();
		if(!dst.equals(str.substring(y - 1, n)))flag = false;
		
		System.out.println(((flag)?"Yes":"No"));
	}
}