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.io.*;
import java.util.*;

public class Main extends PrintWriter {
	Main() { super(System.out, true); }
	Scanner sc = new Scanner(System.in);
	public static void main(String[] $) {
		Main o = new Main(); o.main(); o.flush();
	}

	byte[] cc;
	boolean pal(int i, int j) {
		while (i < j) {
			if (cc[i] != cc[j])
				return false;
			i++; j--;
		}
		return true;
	}
	void main() {
		cc = sc.next().getBytes();
		int n = cc.length;
		int h = (n - 1) / 2;
		println(pal(0, n - 1) && pal(0, h - 1) && pal(h + 1, n - 1) ? "Yes" : "No");
	}
}
