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.*;
public class Main {
	public static void main(String args[]) {
		Scanner sc = new Scanner(System.in);
		String S = sc.next();
		StringBuffer S_temp =new StringBuffer(S);
		String S_r = new String(S_temp.reverse());
		int N = S.length();
		StringBuffer s1_temp = new StringBuffer(S.substring(0, (N - 1) / 2));
		String s1 = new String(s1_temp);
		String  s1_r = new String(s1_temp.reverse());
		StringBuffer s2_temp = new StringBuffer(S.subSequence((N + 3) / 2 - 1, N));
		String s2 = new String(s2_temp);
		String  s2_r = new String(s2_temp.reverse());
		if(S.equals(S_r) && s1.equals(s1_r) && s2.equals(s2_r)){
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}
	}
}
