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
#include <iostream>
#include <cstdio>
using namespace std;

int en;
string s;

int f(int p, int q) {
	int i, j;
	for(i=0, j=q; i<=j; i++, j--) {
		if(s[i] != s[j]) return 0;
	}
	return 1;
}

int main() {
	cin >> s;
	en = s.size() - 1;
	cout << (f(0, en) && f(0, en/2-1) && f(en/2+1, en) ? "Yes" : "No");
	return 0;
}